default search action
Numerical Linear Algebra with Applications, Volume 1
Volume 1, Number 1, January / February 1994
- Owe Axelsson:
Editorial. 1
- Robert Beauwens:
Approximate factorizations with modified S/P consistently ordered M-factors. 3-17 - Robert Beauwens, Yvan Notay, B. Tombuyses:
S/P images of upper triangular M-matrices. 19-31 - Tony F. Chan, Per Christian Hansen:
Low-rank revealing QR factorizations. 33-44 - Rüdiger Weiss:
Properties of generalized conjugate gradient methods. 45-63 - Svetozar Dimitrov Margenov:
Upper bound of the constant in the strengthened C.B.S. inequality for FEM 2D elasticity equations. 65-74 - Owe Axelsson, Panayot S. Vassilevski:
Variable-step multilevel preconditioning methods, I: Self-adjoint and positive definite elliptic problems. 75-101
Volume 1, Number 2, March / April 1994
- Owe Axelsson, Wilhelm Niethammer:
Editorial. 105
- Radim Blaheta:
Displacement decomposition - incomplete factorization preconditioning techniques for linear elasticity problems. 107-128 - Arnd Meyer:
The concept of special inner products for deriving new conjugate gradient-like solvers for non-symmetric sparse linear systems. 129-139 - Fuming Ma, Tassilo Küpper:
Numerical calculation of invariant manifolds for maps. 141-150 - Daniel B. Szyld:
Equivalence of conditions for convergence of iterative methods for singular equations. 151-154 - Owe Axelsson, Lily Yu. Kolotilina:
Diagonally compensated reduction and related preconditioning methods. 155-177 - Igor E. Kaporin:
New convergence results and preconditioning strategies for the conjugate gradient method. 179-210
Volume 1, Number 3, May / June 1994
- Owe Axelsson, Maya G. Neytcheva:
Algebraic multilevel iteration method for Stieltjes matrices. 213-236 - Andrey Andreev, Hussain Juboury:
On the convergence of difference schemes for a heat conduction equation. 237-245 - Achiya Dax:
A row relaxation method for large ℓp least norm problems. 247-263 - François Bonhoure, Yves Dallery, William J. Stewart:
On the use of periodicity properties for the efficient numerical solution of certain Markov chains. 265-286 - Wayne Joubert, Thomas Oppe:
Improved SSOR and incomplete Cholesky solution of linear equations on shared memory and distributed memory parallel computers. 287-311 - Emilio Spedicato, Zhi Chen, Naiyang Deng:
A class of difference ABS-type algorithms for a nonlinear system of equations. 313-329
Volume 1, Number 4, July / August 1994
- Roland W. Freund:
Editorial. 335
- Richard E. Ewing, Raytcho D. Lazarov, Panayot S. Vassilevski:
Local refinement techniques for elliptic problems on cell-centered grids; II. Optimal order two-grid iterative methods. 337-368 - Henk A. van der Vorst, Cornelis Vuik:
GMRESR: a family of nested GMRES methods. 369-386 - Yousef Saad:
ILUT: A dual threshold incomplete LU factorization. 387-402 - Roland W. Freund, Marlis Hochbruck:
On the use of two QMR algorithms for solving singular systems and applications in Markov chain modeling. 403-420
Volume 1, Number 5, September / October 1994
- Wayne Joubert:
On the convergence behavior of the restarted GMRES algorithm for solving nonsymmetric linear systems. 427-447 - Thomas A. Manteuffel, James S. Otto:
On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method. 449-475 - Xiao-Chuan Cai, William D. Gropp, David E. Keyes:
A comparison of some domain decomposition and ILU preconditioned iterative methods for nonsymmetric elliptic problems. 477-504
Volume 1, Number 6, November / December 1994
- Yvan Notay:
DRIC: A dynamic version of the RIC method. 511-532 - Takumi Washio, Ken Hayami:
Parallel block preconditioning based on SSOR and MILU. 533-553 - Carl F. Jagels, Lothar Reichel:
A fast minimal residual algorithm for shifted unitary matrices. 555-570 - Homer F. Walker, Lu Zhou:
A simpler GMRES. 571-581
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.