default search action
Numerical Algorithms, Volume 29
Volume 29, Numbers 1-3, March 2002
- Irfan Altas, Jocelyne Erhel, Murli M. Gupta:
High Accuracy Solution of Three-Dimensional Biharmonic Equations. 1-19 - Claude Brezinski:
Block Descent Methods and Hybrid Procedures for Linear Systems. 21-32 - Claude Brezinski, Michela Redivo-Zaglia:
Block Projection Methods for Linear Systems. 33-43 - Daniela Calvetti, Lothar Reichel:
Lanczos-Based Exponential Filtering for Discrete Ill-Posed Problems. 45-65 - André Draux:
Formal Orthogonal Polynomials and Newton-Padé Approximants. 67-74 - A. El Guennouni, Khalide Jbilou, A. J. Riquet:
Block Krylov Subspace Methods for Solving Large Sylvester Equations. 75-96 - Peter R. Graves-Morris:
The Breakdowns of BiCGStab. 97-105 - Gérard Meurant:
A Multilevel AINV Preconditioner. 107-129 - Dany Mezher, Bernard Philippe:
PAT - a Reliable Path-Following Algorithm. 131-152 - Jean Claude Miellou, Pierre Spitéri:
Optimization of the Relaxation Parameter for S.S.O.R. and A.D.I. Preconditioning. 153-195 - Brígida Molina, Marcos Raydan:
Spectral Variants of Krylov Subspace Methods. 197-208 - D. E. Roberts:
The Vector Epsilon Algorithm - a Residual Approach. 209-227 - Ahmed Salam, Peter R. Graves-Morris:
On the Vector ε-Algorithm for Solving Linear Systems of Equations. 229-247 - Pierre Spitéri, Jean Claude Miellou, Jacques M. Bahi:
Evaluations of Parameters for the Optimization of S.S.O.R. and A.D.I. Preconditioning. 249-265 - Jeannette Van Iseghem:
Vector-Orthogonality and Lanczos-Type Methods. 267-279
Volume 29, Number 4, April 2002
- Yann-Hervé De Roeck:
Sparse Linear Algebra and Geophysical Migration: A Review of Direct and Iterative Methods. 283-322 - Per Christian Hansen:
Deconvolution and Regularization with Toeplitz Matrices. 323-378
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.