J. AARDEN AND K.-E. KARLSSON, Preconditioned CG-type methods for
solving the coupled systems of fundamental semiconductor equations, BIT, 29
(1989), pp. 916-937.
S. ASHBY, CHEBYCODE: A Fortran implementation of
Manteuffel's adaptive Chebyshev algorithm, Tech. Rep. UIUCDCS-R-85-1203,
University of Illinois, 1985.
S. ASHBY, T. MANTEUFFEL, AND J. OTTO, A comparison of adaptive
Chebyshev and least squares polynomial preconditioning for Hermitian
positive definite linear systems, SIAM J. Sci. Statist. Comput., 13 (1992),
pp. 1-29.
O. AXELSSON AND V. EIJKHOUT, Vectorizable preconditioners for
elliptic difference equations in three space dimensions, J. Comput. Appl.
Math., 27 (1989), pp. 299-321.
O. AXELSSON AND I. GUSTAFSSON, Iterative solution for the solution
of the Navier equations of elasticity, Comput. Methods Appl. Mech. Engrg.,
15 (1978), pp. 241-258.
O. AXELSSON AND N. MUNKSGAARD, Analysis of incomplete factorizations
with fixed storage allocation, in Preconditioning Methods - Theory and
Applications, D. Evans, ed., Gordon and Breach, New York, 1983, pp. 265-293.
O. AXELSSON AND B. POLMAN, On approximate factorization methods for
block-matrices suitable for vector and parallel processors, Linear Algebra
Appl., 77 (1986), pp. 3-26.
O. AXELSSON AND P. S. VASSILEVSKI, A black box generalized conjugate
gradient solver with inner iterations and variable-step preconditioning,
SIAM J. Matrix Anal. Appl., 12 (1991), pp. 625-644.
R. BANK, T. CHAN, W. COUGHRAN JR., AND R. SMITH, The
Alternate-Block-Factorization procedure for systems of partial
differential equations, BIT, 29 (1989), pp. 938-954.
R. BANK AND D. ROSE, Marching algorithms for elliptic boundary value
problems. I: The constant coefficient case, SIAM J. Numer. Anal., 14
(1977), pp. 792-829.
A. BJÖRCK AND T. ELFVING, Accelerated projection methods for
computing pseudo-inverse solutions of systems of linear equations, BIT, 19
(1979), pp. 145-163.
J. H. BRAMBLE, J. E. PASCIAK, AND A. H. SCHATZ, The construction of
preconditioners for elliptic problems by substructuring, I, Mathematics of
Computation, 47 (1986), pp. 103- 134.
J. H. BRAMBLE, J. E. PASCIAK, J. WANG, AND J. XU, Convergence
estimates for product iterative methods with applications to domain
decompositions and multigrid, Math. Comp., 57(195) (1991), pp. 1-21.
X.-C. CAI AND O. WIDLUND, Multiplicative Schwarz algorithms for
some nonsymmetric and indefinite problems, SIAM J. Numer. Anal., 30 (1993),
pp. 936-952.
T. CHAN, L. DE PILLIS, AND H. VAN DER VORST, A transpose-free
squared Lanczos algorithm and application to solving nonsymmetric linear
systems, Tech. Rep. CAM 91-17, UCLA, Dept. of Math., Los Angeles, CA
90024-1555, 1991.
T. CHAN, E. GALLOPOULOS, V. SIMONCINI, T. SZETO, AND C. TONG, A
quasi-minimal residual variant of the Bi-CGSTAB algorithm for nonsymmetric
systems, SIAM J. Sci. Comp., 15(2) (1994), pp. 338-347.
T. CHAN, R. GLOWINSKI, , J. PéRIAUX, AND O. WIDLUND, eds., Domain Decomposition Methods, Philadelphia, 1989, SIAM.
Proceedings of the Second International Symposium on Domain
Decomposition Methods, Los Angeles, CA, January 14 - 16, 1988.
T. CHAN AND C.-C. J. KUO, Two-color Fourier analysis of iterative
algorithms for elliptic problems with red/black ordering, SIAM J. Sci.
Statist. Comput., 11 (1990), pp. 767-793.
T. F. CHAN, T. P. MATHEW, AND J. P. SHAO, Efficient variants of the
vertex space domain decomposition algorithm, SIAM J. Sci. Comput., 15(6)
(1994), pp. 1349-1374.
P. CONCUS AND G. GOLUB, A generalized conjugate gradient method for
nonsymmetric systems of linear equations, in Computer methods in Applied
Sciences and Engineering, Second International Symposium, Dec 15-19, 1975;
Lecture Notes in Economics and Mathematical Systems, Vol. 134, Berlin, New
York, 1976, Springer-Verlag.
P. CONCUS, G. GOLUB, AND D. O'LEARY, A generalized conjugate
gradient method for the numerical solution of elliptic partial differential
equations, in Sparse Matrix Computations, J. Bunch and D. Rose, eds.,
Academic Press, New York, 1976, pp. 309-332.
P. CONCUS AND G. H. GOLUB, Use of fast direct methods for the
efficient numerical solution of nonseparable elliptic equations, SIAM J.
Numer. Anal., 10 (1973), pp. 1103-1120.
E. D'AZEVEDO, V. EIJKHOUT, AND C. ROMINE, LAPACK working note 56:
Reducing communication costs in the conjugate gradient algorithm on
distributed memory multiprocessor, tech. report, Computer Science
Department, University of Tennessee, Knoxville, TN, 1993.
E. D'AZEVEDO AND C. ROMINE, Reducing communication costs in the
conjugate gradient algorithm on distributed memory multiprocessors, Tech.
Rep. ORNL/TM-12192, Oak Ridge National Lab, Oak Ridge, TN, 1992.
E. DE STURLER AND D. R. FOKKEMA, Nested Krylov methods and
preserving the orthogonality, Tech. Rep. Preprint 796, Utrecht University,
Utrecht, The Netherlands, 1993.
J. DONGARRA, J. DUCROZ, S. HAMMARLING, AND R. HANSON, An extended
set of FORTRAN Basic Linear Algebra Subprograms, ACM Trans. Math.
Soft., 14 (1988), pp. 1-32.
J. DONGARRA AND H. VAN DER VORST, Performance of various computers
using standard sparse linear equations solving techniques, in Computer
Benchmarks, J. Dongarra and W. Gentzsch, eds., Elsevier Science Publishers
B.V., New York, 1993, pp. 177-188.
M. DRYJA AND O. B. WIDLUND, Towards a unified theory of domain
decomposition algorithms for elliptic problems, Tech. Rep. 486, also
Ultracomputer Note 167, Department of Computer Science, Courant Institute,
1989.
D. DUBOIS, A. GREENBAUM, AND G. RODRIGUE, Approximating the inverse
of a matrix for use in iterative algorithms on vector processors, Computing,
22 (1979), pp. 257-268.
T. DUPONT, R. KENDALL, AND H. RACHFORD, An approximate factorization
procedure for solving self-adjoint elliptic difference equations, SIAM J.
Numer. Anal., 5 (1968), pp. 559-573.
E. D'YAKONOV, The method of variable directions in solving systems
of finite difference equations, Soviet Math. Dokl., 2 (1961), pp. 577-580.
TOM 138, 271-274.
height 2pt depth -1.6pt width 23pt, Beware of
unperturbed modified incomplete point factorizations, in Proceedings of the
IMACS International Symposium on Iterative Methods in Linear Algebra,
Brussels, Belgium, R. Beauwens and P. de Groen, eds., 1992.
height 2pt depth -1.6pt width 23pt, LAPACK working
note 51: Qualitative properties of the conjugate gradient and Lanczos
methods in a matrix framework, Tech. Rep. CS 92-170, Computer Science
Department, University of Tennessee, Knoxville, TN, 1992.
V. EIJKHOUT AND B. POLMAN, Decay rates of inverses of banded
-matrices that are near to Toeplitz matrices, Linear Algebra Appl.,
109 (1988), pp. 247-277.
R. ELKIN, Convergence theorems for Gauss-Seidel and other
minimization algorithms, Tech. Rep. 68-59, Computer Science Center,
University of Maryland, College Park, MD, Jan. 1968.
H. ELMAN AND M. SCHULTZ, Preconditioning by fast direct methods for
non self-adjoint nonseparable elliptic equations, SIAM J. Numer. Anal., 23
(1986), pp. 44-57.
V. FABER AND T. MANTEUFFEL, Necessary and sufficient conditions for
the existence of a conjugate gradient method, SIAM J. Numer. Anal., 21
(1984), pp. 315-339.
G. FAIRWEATHER, A. GOURLAY, AND A. MITCHELL, Some high accuracy
difference schemes with a splitting operator for equations of parabolic and
elliptic type, Numer. Math., 10 (1967), pp. 56-66.
R. FLETCHER, Conjugate gradient methods for indefinite systems, in
Numerical Analysis Dundee 1975, G. Watson, ed., Berlin, New York, 1976,
Springer Verlag, pp. 73-89.
R. FREUND, Conjugate gradient-type methods for linear systems with
complex symmetric coefficient matrices, SIAM J. Sci. Statist. Comput., 13
(1992), pp. 425-448.
R. FREUND, M. GUTKNECHT, AND N. NACHTIGAL, An implementation of the
look-ahead Lanczos algorithm for non-Hermitian matrices, SIAM J. Sci.
Comput., 14 (1993), pp. 137-158.
height 2pt depth -1.6pt width 23pt, An implementation of
the QMR method based on coupled two-term recurrences, SIAM J. Sci.
Statist. Comput., 15 (1994), pp. 313-337.
R. FREUND AND T. SZETO, A quasi-minimal residual squared algorithm
for non-Hermitian linear systems, Tech. Rep. CAM Report 92-19, UCLA Dept.
of Math., 1992.
R. GLOWINSKI, G. H. GOLUB, G. A. MEURANT, AND J. PéRIAUX, eds., Domain Decomposition Methods for Partial Differential Equations, SIAM,
Philadelphia, 1988.
Proceedings of the First International Symposium on Domain
Decomposition Methods for Partial Differential Equations, Paris,
France, January 1987.
A. GREENBAUM AND Z. STRAKOS, Predicting the behavior of finite
precision Lanczos and conjugate gradient computations, SIAM J. Mat.
Anal. Appl., 13 (1992), pp. 121-137.
M. H. GUTKNECHT, The unsymmetric Lanczos algorithms and their
relations to Páde approximation, continued fractions and the QD
algorithm, in Proceedings of the Copper Mountain Conference on Iterative
Methods, 1990.
height 2pt depth -1.6pt width 23pt, A completed theory
of the unsymmetric Lanczos process and related algorithms, part I, SIAM
J. Matrix Anal. Appl., 13 (1992), pp. 594-639.
height 2pt depth -1.6pt width 23pt, A completed theory
of the unsymmetric Lanczos process and related algorithms, part II, SIAM
J. Matrix Anal. Appl., 15 (1994), pp. 15-58.
K. JEA AND D. YOUNG, Generalized conjugate-gradient acceleration of
nonsym- metrizable iterative methods, Linear Algebra Appl., 34 (1980),
pp. 159-194.
M. JONES AND P. PLASSMANN, Parallel solution of unstructed, sparse
systems of linear equations, in Proceedings of the Sixth SIAM conference on
Parallel Processing for Scientific Computing, R. Sincovec, D. Keyes,
M. Leuze, L. Petzold, and D. Reed, eds., SIAM, Philadelphia, pp. 471-475.
D. KERSHAW, The incomplete Cholesky-conjugate gradient method for
the iterative solution of systems of linear equations, J. Comput. Phys., 26
(1978), pp. 43-65.
R. KETTLER, Analysis and comparison of relaxation schemes in robust
multigrid and preconditioned conjugate gradient methods, in Multigrid
Methods, Lecture Notes in Mathematics 960, W. Hackbusch and U. Trottenberg,
eds., Springer-Verlag, Berlin, New York, 1982, pp. 502-534.
height 2pt depth -1.6pt width 23pt, Linear multigrid
methods in numerical reservoir simulation, PhD thesis, Delft University of
Technology, Delft, The Netherlands, 1987.
D. E. KEYES, T. F. CHAN, G. MEURANT, J. S. SCROGGS, AND R. G. VOIGT,
eds., Domain Decomposition Methods For Partial Differential Equations,
SIAM, Philadelphia, 1992.
Proceedings of the Fifth International Symposium on Domain
Decomposition Methods, Norfolk, VA, 1991.
D. E. KEYES AND W. D. GROPP, A comparison of domain decomposition
techniques for elliptic partial differential equations and their parallel
implementation, SIAM J. Sci. Statist. Comput., 8 (1987), pp. s166 - s202.
height 2pt depth -1.6pt width 23pt, Domain decomposition
for nonsymmetric systems of equations: Examples from computational fluid
dynamics, in Domain Decomposition Methods, proceedings of the Second
Internation Symposium, Los Angeles, California, January 14-16, 1988, T. F.
Chan, R. Glowinski, J. Periaux, and O. B. Widlund, eds., Philadelphia, 1989,
SIAM, pp. 373-384.
height 2pt depth -1.6pt width 23pt, Domain decomposition
techniques for the parallel solution of nonsymmetric systems of elliptic
boundary value problems, Applied Num. Math., 6 (1989/1990), pp. 281-301.
D. R. KINCAID, J. R. RESPESS, D. M. YOUNG, AND R. G. GRIMES, ITPACK 2C: A Fortran package for solving large sparse linear systems
by adaptive accelerated iterative methods, ACM Trans. Math. Soft., 8 (1982),
pp. 302-322.
Algorithm 586.
L. Y. KOLOTILINA AND A. Y. YEREMIN, On a family of two-level
preconditionings of the incomlete block factorization type, Sov. J. Numer.
Anal. Math. Modelling, (1986), pp. 293-320.
C. LANCZOS, An iteration method for the solution of the eigenvalue
problem of linear differential and integral operators, J. Res. Nat. Bur.
Stand., 45 (1950), pp. 255-282.
J. MAITRE AND F. MUSY, The contraction number of a class of
two-level methods; an exact evaluation for some finite element subspaces and
model problems, in Multigrid methods, Proceedings, Köln-Porz, 1981,
W. Hackbusch and U. Trottenberg, eds., vol. 960 of Lecture Notes in
Mathematics, 1982, pp. 535-544.
height 2pt depth -1.6pt width 23pt, An incomplete
factorization technique for positive definite linear systems, Mathematics of
Computation, 34 (1980), pp. 473-497.
U. MEIER AND A. SAMEH, The behavior of conjugate gradient algorithms
on a multivector processor with a hierarchical memory, J. Comput. Appl.
Math., 24 (1988), pp. 13-32.
U. MEIER-YANG, Preconditioned conjugate gradient-like methods for
nonsymmetric linear systems, tech. rep., CSRD, University of Illinois,
Urbana, IL, April 1992.
J. MEIJERINK AND H. VAN DER VORST, An iterative solution method for
linear systems of which the coefficient matrix is a symmetric -matrix,
Mathematics of Computation, 31 (1977), pp. 148-162.
height 2pt depth -1.6pt width 23pt, Guidelines for the
usage of incomplete decompositions in solving sets of linear equations as
they occur in practical problems, J. Comput. Phys., 44 (1981), pp. 134-155.
R. MELHEM, Toward efficient implementation of preconditioned
conjugate gradient methods on vector supercomputers, Internat. J.
Supercomput. Appls., 1 (1987), pp. 77-98.
N. MUNKSGAARD, Solving sparse symmetric sets of linear equations by
preconditioned conjugate gradients, ACM Trans. Math. Software, 6 (1980),
pp. 206-219.
N. NACHTIGAL, L. REICHEL, AND L. TREFETHEN, A hybrid GMRES
algorithm for nonsymmetric matrix iterations, SIAM J. Sci. Statist. Comput.,
13 (1992), pp. 796-825.
N. M. NACHTIGAL, A Look-Ahead Variant of the Lanczos Algorithm and
its Application to the Quasi-Minimal Residual Methods for Non-Hermitian
Linear Systems, PhD thesis, MIT, Cambridge, MA, 1991.
Y. NOTAY, Solving positive (semi)definite linear systems by
preconditioned iterative methods, in Preconditioned Conjugate Gradient
Methods, O. Axelsson and L. Kolotilina, eds., vol. 1457 of Lecture Notes in
Mathematics, Nijmegen, 1989, pp. 105-125.
height 2pt depth -1.6pt width 23pt, On the robustness of
modified incomplete factorization methods, Internat. J. Comput. Math., 40
(1992), pp. 121-141.
height 2pt depth -1.6pt width 23pt, Ordering schemes for
parallel processing of certain mesh problems, SIAM J. Sci. Statist. Comput.,
5 (1984), pp. 620-632.
T. C. OPPE, W. D. JOUBERT, AND D. R. KINCAID, NSPCG user's guide,
version 1.0: A package for solving large sparse linear systems by various
iterative methods, Tech. Rep. CNA-216, Center for Numerical Analysis,
University of Texas at Austin, Austin, TX, April 1988.
C. PAIGE, B. PARLETT, AND H. VAN DER VORST, Approximate solutions
and eigenvalue bounds from Krylov subspaces, Numer. Lin. Alg. Appls., 29
(1995), pp. 115-134.
B. N. PARLETT, D. R. TAYLOR, AND Z. A. LIU, A look-ahead Lanczos
algorithm for unsymmetric matrices, Mathematics of Computation, 44 (1985),
pp. 105-124.
D. PEACEMAN AND J. H.H. RACHFORD, The numerical solution of
parabolic and elliptic differential equations, J. Soc. Indust. Appl. Math.,
3 (1955), pp. 28-41.
C. POMMERELL, Solution of Large Unsymmetric Systems of Linear
Equations, vol. 17 of Series in Micro-electronics, volume 17, Hartung-Gorre
Verlag, Konstanz, 1992.
height 2pt depth -1.6pt width 23pt, Solution of large
unsymmetric systems of linear equations, PhD thesis, Swiss Federal Institute
of Technology, Zürich, Switzerland, 1992.
E. POOLE AND J. ORTEGA, Multicolor ICCG methods for vector
computers, Tech. Rep. RM 86-06, Department of Applied Mathematics,
University of Virginia, Charlottesville, VA, 1986.
A. QUARTERONI, J. PERIAUX, Y. KUZNETSOV, AND O. WIDLUND, eds., Domain Decomposition Methods in Science and Engineering,, vol. Contemporary
Mathematics 157, Providence, RI, 1994, AMS.
Proceedings of the Sixth International Symposium on Domain
Decomposition Methods, June 15-19, 1992, Como, Italy,.
G. RADICATI DI BROZOLO AND Y. ROBERT, Vector and parallel
CG-like algorithms for sparse non-symmetric systems, Tech. Rep. 681-M,
IMAG/TIM3, Grenoble, France, 1987.
J. REID, On the method of conjugate gradients for the solution of
large sparse systems of linear equations, in Large Sparse Sets of Linear
Equations, J. Reid, ed., Academic Press, London, 1971, pp. 231-254.
Y. SAAD, The Lanczos biorthogonalization algorithm and other
oblique projection methods for solving large unsymmetric systems, SIAM J.
Numer. Anal., 19 (1982), pp. 485-506.
height 2pt depth -1.6pt width 23pt, Practical use of
some Krylov subspace methods for solving indefinite and nonsymmetric linear
systems, SIAM J. Sci. Statist. Comput., 5 (1984), pp. 203-228.
height 2pt depth -1.6pt width 23pt, Practical use of
polynomial preconditionings for the conjugate gradient method, SIAM J. Sci.
Statist. Comput., 6 (1985), pp. 865-881.
height 2pt depth -1.6pt width 23pt, Preconditioning
techniques for indefinite and nonsymmetric linear systems, J. Comput. Appl.
Math., 24 (1988), pp. 89-105.
Y. SAAD AND M. SCHULTZ, Conjugate gradient-like algorithms for
solving nonsymmetric linear systems, Mathematics of Computation, 44 (1985),
pp. 417-424.
G. L. G. SLEIJPEN AND D. R. FOKKEMA, Bi-CGSTAB() for linear
equations involving unsymmetric matrices with complex spectrum, Elec. Trans.
Numer. Anal., 1 (1993), pp. 11-32.
B. F. SMITH, Domain decomposition algorithms for partial
differential equations of linear elasticity, Tech. Rep. 517, Department of
Computer Science, Courant Institute, 1990.
H. STONE, Iterative solution of implicit approximations of
multidimensional partial differential equations, SIAM J. Numer. Anal., 5
(1968), pp. 530-558.
P. SWARZTRAUBER, The methods of cyclic reduction, Fourier analysis
and the FACR algorithm for the discrete solution of Poisson's equation on
a rectangle, SIAM Rev., 19 (1977), pp. 490-501.
C. TONG, A comparative study of preconditioned Lanczos methods for
nonsymmetric linear systems, Tech. Rep. SAND91-8240, Sandia Nat. Lab.,
Livermore, CA, 1992.
H. VAN DER VORST, Iterative solution methods for certain sparse
linear systems with a non-symmetric matrix arising from PDE-problems, J.
Comput. Phys., 44 (1981), pp. 1-19.
height 2pt depth -1.6pt width 23pt, Large tridiagonal
and block tridiagonal linear systems on vector and parallel computers,
Parallel Comput., 5 (1987), pp. 45-54.
height 2pt depth -1.6pt width 23pt, ICCG and related
methods for 3D problems on vector computers, Computer Physics
Communications, 53 (1989), pp. 223-235.
height 2pt depth -1.6pt width 23pt, The convergence
behavior of preconditioned CG and CG-S in the presence of rounding
errors, in Preconditioned Conjugate Gradient Methods, O. Axelsson and L. Y.
Kolotilina, eds., vol. 1457 of Lecture Notes in Mathematics, Berlin, New
York, 1990, Springer-Verlag.
height 2pt depth -1.6pt width 23pt, Bi-CGSTAB: A
fast and smoothly converging variant of Bi-CG for the solution of
nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 13 (1992),
pp. 631-644.
J. VAN ROSENDALE, Minimizing inner product data dependencies in
conjugate gradient iteration, Tech. Rep. 172178, ICASE, NASA Langley
Research Center, 1983.
V. VOEVODIN, The problem of non-self-adjoint generalization of the
conjugate gradient method is closed, U.S.S.R. Comput. Maths. and Math.
Phys., 23 (1983), pp. 143-144.
-factors, BIT, 29
(1989), pp. 658-681.
-step iterative methods for
symmetric linear systems, J. Comput. Appl. Math., 25 (1989), pp. 153-168.
best for the SOR
iteration method?, Linear Algebra Appl., 182 (1993), pp. 257-277.
) for linear
equations involving unsymmetric matrices with complex spectrum, Elec. Trans.
Numer. Anal., 1 (1993), pp. 11-32.
where 
is symmetric complex, IEEE Trans.
Magnetics, 26 (1990), pp. 706-708.