Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[ספר][B] Optimization in solving elliptic problems
EG D'yakonov - 2018 - taylorfrancis.com
Optimization in Solving Elliptic Problems focuses on one of the most interesting and
challenging problems of computational mathematics-the optimization of numerical …
challenging problems of computational mathematics-the optimization of numerical …
On the spectra of sums of orthogonal projections with applications to parallel computing
Many parallel iterative algorithms for solving symmetric, positive definite problems proceed
by solving in each iteration, a number of independent systems on subspaces. The …
by solving in each iteration, a number of independent systems on subspaces. The …
[ספר][B] Electric power: distribution emergency operation
Reducing power outage time to each customer is essential to the overall distribution
reliability. This book provides the fundamentals of emergency operation using a graph …
reliability. This book provides the fundamentals of emergency operation using a graph …
[PDF][PDF] Sparse matrix multiplication package (SMMP).
Sparse Matrix Multiplication Package (SMMP) Page 1 Sparse Matrix Multiplication Package
(SMMP) ∗ Randolph E. Bank† Craig C. Douglas‡ April 23, 2001 Abstract: Routines callable …
(SMMP) ∗ Randolph E. Bank† Craig C. Douglas‡ April 23, 2001 Abstract: Routines callable …
A unified convergence theory for abstract multigrid or multilevel algorithms, serial and parallel
Multigrid methods are analyzed in the style of standard iterative methods. A basic error
bound is derived in terms of residuals on neighboring levels. The terms in this bound derive …
bound is derived in terms of residuals on neighboring levels. The terms in this bound derive …
[ספר][B] A relational approach to the automatic generation of sequential sparse matrix codes
PV Stodghill - 1997 - search.proquest.com
This thesis presents techniques for automatically generating sparse codes from dense
matrix algorithms through a process called sparse compilation. We will start by recognizing …
matrix algorithms through a process called sparse compilation. We will start by recognizing …
Numerical exploitation of equivariance
EL Allgower, K Georg, R Miranda… - ZAMM‐Journal of …, 1998 - Wiley Online Library
Linear operators in equations describing physical problems on a symmetric domain often
are also equivariant, which means that they commute with its symmetries, ie, with the group …
are also equivariant, which means that they commute with its symmetries, ie, with the group …
[ספר][B] Improving the performance and scalability of algebraic multigrid solvers through applied performance modeling
HB Gahvari - 2014 - search.proquest.com
With single-core speeds no longer rising, dramatically increased parallelism is now the
means of getting more performance from supercomputers. The current generation of …
means of getting more performance from supercomputers. The current generation of …
An abstract theory for the domain reduction method
The domain reduction method uses a finite group of symmetries of a system of linear
equations arising by discretization of partial differential equations to obtain a decomposition …
equations arising by discretization of partial differential equations to obtain a decomposition …
[PDF][PDF] MGNet Bibliography
CC Douglas, MB Douglas - Department of Computer Science and the …, 1991 - Citeseer
For a correction, please send the date that is on page 1, the citation number, and the
correction. Note that the bibliography is updated on MGNet less often than on our computer …
correction. Note that the bibliography is updated on MGNet less often than on our computer …