Approximation of the scattering amplitude and linear systems

Electronic Transactions on Numerical Analysis

Volumn 31, Issue , 2008, Pages 178-203

  Golub, Gene H ^a   Stoll, Martin ^b   Wathen, Andy ^b  

^a Stanford University   (United States)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Adjoint systems; Gauss quadrature; Krylov subspaces; Linear systems

Indexed keywords

LINEAR SYSTEMS; SIGNAL PROCESSING;

ADJOINT SYSTEM; GAUSS QUADRATURES; KRYLOV SUB SPACES; NON SINGULAR MATRICES; QUASI-MINIMAL RESIDUAL ALGORITHMS; SCATTERING AMPLITUDES; SIMULTANEOUS SOLUTION; SPEED OF CONVERGENCE;

FORWARD SCATTERING;

EID: 67349192513     PISSN: None     EISSN: 10689613     Source Type: Journal    
DOI: None     Document Type: Article

References (47)

1. M. Arioli, A stopping criterion for the conjugate gradient algorithms in a finite element method framework, Numer. Math., 97 (2004), pp. 1-24.
2. D. Arnett, Supernovae and Nucleosynthesis: An Investigation of the History of Matter, from the Big Bang to the Present, Princeton University Press, 1996.
3. Z.-Z. Bai, I. S. Duff, and A. J. Wathen, A class of incomplete orthogonal factorization methods. I. Methods and theories, BIT, 41 (2001), pp. 53-70.
4. A. Bjorck, A bidiagonalization algorithm for solving ill-posed system of linear equations, BIT, 28 (1988), pp. 659-670.
5. G. Dahlquist, S. C. Eisenstat, and G. H. Golub, Bounds for the error of linear systems of equations using the theory of moments, J. Math. Anal. Appl., 37 (1972), pp. 151-166.
6. P. J. Davis and P. Rabinowitz, Methods of Numerical Integration, Computer Science and Applied Mathematics, Academic Press Inc, Orlando, second ed., 1984.
7. H. C. Elman, A. Ramage, and D. J. Silvester, Algorithm 886: IFISS, aMatlab toolbox for modelling incompressible flow, ACM Trans. Math. Software, 33 (2007), 14 (18 pages).
8. H. C. Elman, D. J. Silvester, and A. J. Wathen, Finite Elements and Fast Iterative Solvers: with Applications in Incompressible Fluid Dynamics, Numerical Mathematics and Scientific Computation, Oxford University Press, New York, 2005.
9. R. Fletcher, Conjugate gradient methods for indefinite systems, in Numerical Analysis (Proc 6th Biennial Dundee Conf., Univ. Dundee, Dundee, 1975), G. Watson, ed., vol.506 of Lecture Notes in Math., Springer, Berlin, 1976, pp. 73-89.
10. R. W. Freund, M. H. Gutknecht, and N. M. Nachtigal, An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, SIAM J. Sci. Comput., 14 (1993), pp. 137-158.
11. R. W. Freund and N. M. Nachtigal, QMR: A quasi-minimal residual method for non-Hermitian linear systems, Numer. Math., 60 (1991), pp. 315-339.
12. W. Gautschi, Construction of Gauss-Christoffel quadrature formulas, Math. Comp., 22 (1968), pp. 251 270.
13. M. B. Giles and N. A. P ierce, An introduction to the adjoint approach to design, Flow, Turbulence and Combustion, 65 (2000), pp. 393-415.
14. M. B. Giles and E. Suli, Adjoint methods for PDEs: A posteriori error analysis and postprocessing by duality, Acta Numer., 11 (2002), pp. 145-236.
15. G. Golub and W. Kahan, Calculating the singular values and pseudo-inverse ofa matrix, J. Soc. Indust. Appl. Math. Ser. B Numer. Anal, 2 (1965), pp. 205-224.
16. G. H. Golub, Some modified matrix eigenvalue problems, SIAM Rev., 15 (1973), pp. 318-334.
17. Bounds for matrix moments, Rocky Mountain J. Math., 4 (1974), pp. 207-211.
18. G. H. Golub and G. Meurant, Matrices, moments and quadrature, in Numerical Analysis 1993 (Dundee, 1993), D. Griffiths and G. Watson, eds., vol.303 of Pitman Res. Notes Math. Ser., Longman Sci. Tech, Harlow, 1994, pp. 105-156.
19. G. H. Golub and G. M eurant, Matrices, moments and quadrature. II. How to compute the norm ofthe error in iterative methods, BIT, 37 (1997), pp. 687-705.
20. Matrices, Moments and Quadrature with Applications. Draft, 2007.
21. G. H. Golub, G. N. Minerbo, and P. E. Saylor, Nine ways to compute the scattering cross section (i): Estimating cTx iteratively. Draft, 2007.
22. G. H. Golub and R. Underwood, The block Lanczos method for computing eigenvalues, in Mathematical software, III (Proc. Sympos., Math. Res. Center, Univ. Wisconsin, 1977), J. R. Rice, ed., Academic Press, New York, 1977, pp. 361-377.
23. G. H. Golub and C. F. Van Loan, Matrix Computations, Johns Hopkins Studies in the Mathematical Sciences, Johns Hopkins University Press, Baltimore, third ed., 1996.
24. G. H. Golub and J. H. Welsch, Calculation of Gauss quadrature rules, Math. Comp., 23 (1969), pp. 221 230.
25. A. Greenbaum, Iterative Methods for Solving Linear Systems, vol.17 of Frontiers in Applied Mathematics, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 1997.
26. M. R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Stand, 49 (1952), pp. 409-436.
27. I. Hnetynkova and Z. Strakos, Lanczos tridiagonalization and core problems, Linear Algebra Appl., 421 (2007), pp. 243-251.
28. L. D. Landau and E. Lifshitz, Quantum Mechanics, Pergamon Press, Oxford, 1965.
29. J. Lu and D. L. Darmofal, A quasi-minimal residual method for simultaneous primal-dual solutions and superconvergent functional estimates, SIAM J. Sci. Comput., 24 (2003), pp. 1693-1709.
30. G. Meurant, Computer Solution ofLarge Linear Systems, vol.28 of Studies in Mathematics and its Applications, North-Holland, Amsterdam, 1999.
31. N. M. Nachtigal, S. C. Reddy, and L. N. Trefethen, How fast are nonsymmetric matrix iterations?, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 778-795.
32. C. C. Paige and M. A. Saunders, Solutions of sparse indefinite systems of linear equations, SIAM J. Numer. Anal, 12 (1975), pp. 617-629.
33. C. C. Paige and M. A. Saunders, Algorithm 583; LSQR: sparse linear equations and least-squares problems, ACM Trans. Math. Software, 8 (1982), pp. 195-209.
34. LSQR: an algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Software, 8 (1982), pp. 43-71.
35. A. T. Papadopoulos, I. S. Duff, and A. J. Wathen, A class ofincomplete orthogonal factorization methods. II. Implementation and results, BIT, 45 (2005), pp. 159-179.
36. B. N. Parlett, D. R. Taylor, and Z. A. Liu, A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comp., 44 (1985), pp. 105-124.
37. L. Reichel and Q. Ye, A generalized LSQR algorithm, Numer. Linear Algebra Appl., 15 (2008), pp. 643 660.
38. P. D. Robinson and A. J. Wathen, Variational bounds on the entries of the inverse of a matrix, IMA J. Numer. Anal., 12 (1992), pp. 463-486.
39. Y. Saad, Iterative Methods for Sparse Linear Systems, Society for Industrial and Applied Mathematics, Philadelphia, 2003. Second edition.
40. M. A. Saunders, H. D. Simon, and E. L. Yip, Two conjugate-gradient-type methods for unsymmetric linear equations, SIAM J. Numer. Anal, 25 (1988), pp. 927-940.
41. P. E. Saylor and D. C. Smolarski, Why Gaussian quadrature in the complex plane?, Numer. Algorithms, 26 (2001), pp. 251-280.
42. Addendum to: "Why Gaussian quadrature in the complex plane?" [Numer. Algorithms 26 (2001), pp. 251-280], Numer. Algorithms, 27 (2001), pp. 215-217.
43. Z. StrakoS and P. Tichy, On error estimation in the conjugate gradient method and why it works infinite precision computations, Electron. Trans. Numer. Anal., 13 (2002), pp. 56-80. http://etna.math.kent.edu/vol.13.2 002/pp56-80.dir/.
44. Error estimation in preconditioned conjugate gradients, BIT, 45 (2005), pp. 789-817.
45. -1b via matching moments. Submitted, 2008.
46. H. A. Van der Vorst, BiCGSTAB: A fast and smoothly converging variant of BiCG for the solution of nonsymmetric linear systems, SIAM J. Sci. Stat. Comput., 13 (1992), pp. 631-644.
47. H. A. van der Vorst, Iterative Krylov Methods for Large Linear Systems, vol.13 of Cambridge Monographs on Applied and Computational Mathematics, Cambridge University Press, Cambridge, 2003.