Estimates for Some Computational Techniques in Linear Algebra
From MaRDI portal
Publication:5535882
DOI10.2307/2003590zbMath0156.16202MaRDI QIDQ5535882
Publication date: 1966
Full work available at URL: https://doi.org/10.2307/2003590
Related Items
How to Make the Lanczos Algorithm Converge Slowly, The Lanczos Algorithm with Selective Orthogonalization, Optimal a priori error bounds for the Rayleigh-Ritz method, On Meinardus' examples for the conjugate gradient method, Practical use of the symmetric Lanczos process with re-orthogonalization, An explicit formula for Lanczos polynomials, Rational Krylov sequence methods for eigenvalue computation, The nonsymmetric Lanczos algorithm and controllability, Computing interior eigenvalues of large matrices, On preconditioned eigensolvers and invert-Lanczos processes, On the rate of convergence of the preconditioned conjugate gradient method, Analysis of the symmetric Lanczos algorithm with reorthogonalization methods, The rate of convergence of conjugate gradients, The convergence behavior of Ritz values in the presence of close eigenvalues, The block conjugate gradient algorithm and related methods, A new look at the Lanczos algorithm for solving symmetric systems of linear equations, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem, Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights, Analytical bounds for block approximate factorization methods, The convergence of the method of conjugate gradients at isolated extreme points of the spectrum, Comparison of splittings used with the conjugate gradient algorithm, On the numerical solution of the eigenvalue problem of the Laplace operator by a capacitance matrix method, A generalized nonsymmetric Lanczos procedure, Towards a black box Lanczos program, Implementing Lanczos-like algorithms on hypercube architectures, Iterative solution of linear systems in the 20th century, Eigenvalue computation in the 20th century, Krylov space methods on state-space control models, Krylov subspace methods for eigenvalues with special properties and their analysis for normal matrices, Further results on the convergence behavior of conjugate-gradients and Ritz values, On the use of harmonic Ritz pairs in approximating internal eigenpairs, Computing eigenvalues: Lanczos algorithm with a new recursive partitioning method, Theoretical error bounds on the convergence of the Lanczos and block-Lanczos methods, Least-square acceleration of iterative methods for linear equations, Rayleigh-Ritz and Lanczos methods for symmetric matrix pencils, Convergence of CG and GMRES on a tridiagonal Toeplitz linear system, Vandermonde matrices with Chebyshev nodes, Computation of a few smallest eigenvalues of elliptic operators using fast elliptic solvers, Variational and numerical methods for symmetric matrix pencils, A discrete Newton algorithm for minimizing a function of many variables, An Incomplete Factorization Technique for Positive Definite Linear Systems, Some basic information on information-based complexity theory, An Application of Approximation Theory to an Error Estimate in Linear Algebra
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Über diskrete und lineare Tschebyscheff-Approximationen
- Moments and characteristic roots
- R. A. Fisher and evolutionary theory
- On the approximation of symmetric operators by operators of finite rank
- Über eine Verallgemeinerung einer Ungleichung von L.V. Kantorowitsch
- Methods of conjugate gradients for solving linear systems
