Estimates for Some Computational Techniques in Linear Algebra
From MaRDI portal
Publication:5535882
DOI10.2307/2003590zbMath0156.16202OpenAlexW4241032568MaRDI QIDQ5535882
Publication date: 1966
Full work available at URL: https://doi.org/10.2307/2003590
Related Items (64)
The rate of convergence of conjugate gradients ⋮ Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry ⋮ A generalized nonsymmetric Lanczos procedure ⋮ Towards a black box Lanczos program ⋮ Implementing Lanczos-like algorithms on hypercube architectures ⋮ Rayleigh-Ritz and Lanczos methods for symmetric matrix pencils ⋮ Optimal a priori error bounds for the Rayleigh-Ritz method ⋮ An Incomplete Factorization Technique for Positive Definite Linear Systems ⋮ Optimal Low-rank Approximations of Bayesian Linear Inverse Problems ⋮ The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor ⋮ The convergence behavior of Ritz values in the presence of close eigenvalues ⋮ Convergence Analysis of Restarted Krylov Subspace Eigensolvers ⋮ Some basic information on information-based complexity theory ⋮ How to Make the Lanczos Algorithm Converge Slowly ⋮ Variational and numerical methods for symmetric matrix pencils ⋮ The Lanczos Algorithm with Selective Orthogonalization ⋮ Practical use of the symmetric Lanczos process with re-orthogonalization ⋮ The block conjugate gradient algorithm and related methods ⋮ A new look at the Lanczos algorithm for solving symmetric systems of linear equations ⋮ Improved estimation of relaxation time in nonreversible Markov chains ⋮ Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices ⋮ Numerical solution of linear eigenvalue problems ⋮ Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem ⋮ \textit{TimeEvolver}: a program for time evolution with improved error bound ⋮ The genesis and early developments of Aitken's process, Shanks' transformation, the \(\varepsilon\)-algorithm, and related fixed point methods ⋮ Computing eigenvalues: Lanczos algorithm with a new recursive partitioning method ⋮ Theoretical error bounds on the convergence of the Lanczos and block-Lanczos methods ⋮ Numerical determination of partial spectrum of Hermitian matrices using a Lánczos method with selective reorthogonalization ⋮ Convergence of CG and GMRES on a tridiagonal Toeplitz linear system ⋮ The Lanczos Algorithm Under Few Iterations: Concentration and Location of the Output ⋮ Convergence of the block Lanczos method for eigenvalue clusters ⋮ Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights ⋮ Sharp Ritz value estimates for restarted Krylov subspace iterations ⋮ Uniform Error Estimates for the Lanczos Method ⋮ Computation of a few smallest eigenvalues of elliptic operators using fast elliptic solvers ⋮ A Neumann-Neumann preconditioned iterative substructuring approach for computing solutions to Poisson's equation with prescribed jumps on an embedded boundary ⋮ A modified SSOR-like preconditioner for non-Hermitian positive definite matrices ⋮ Vandermonde matrices with Chebyshev nodes ⋮ Analytical bounds for block approximate factorization methods ⋮ Bounding the spectrum of large Hermitian matrices ⋮ An Adaptive MultiPreconditioned Conjugate Gradient Algorithm ⋮ The convergence of the method of conjugate gradients at isolated extreme points of the spectrum ⋮ Sharpness in rates of convergence for the symmetric Lanczos method ⋮ Least-square acceleration of iterative methods for linear equations ⋮ On Meinardus' examples for the conjugate gradient method ⋮ An explicit formula for Lanczos polynomials ⋮ Structure-preserving \(\Gamma\) QR and \(\Gamma\)-Lanczos algorithms for Bethe-Salpeter eigenvalue problems ⋮ On preconditioned eigensolvers and invert-Lanczos processes ⋮ 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 ⋮ An Application of Approximation Theory to an Error Estimate in Linear Algebra ⋮ 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 ⋮ Rational Krylov sequence methods for eigenvalue computation ⋮ A discrete Newton algorithm for minimizing a function of many variables ⋮ Iterative solution of linear systems in the 20th century ⋮ Eigenvalue computation in the 20th century ⋮ On the rate of convergence of the preconditioned conjugate gradient method ⋮ On the use of harmonic Ritz pairs in approximating internal eigenpairs ⋮ Analysis of the symmetric Lanczos algorithm with reorthogonalization methods ⋮ The nonsymmetric Lanczos algorithm and controllability ⋮ Computing interior eigenvalues of large matrices ⋮ On the condition number of the critically-scaled Laguerre unitary ensemble
Cites Work
- Ü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
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Estimates for Some Computational Techniques in Linear Algebra
