Pages that link to "Item:Q5667414"
From MaRDI portal
The following pages link to Computational Variants of the Lanczos Method for the Eigenproblem (Q5667414):
Displaying 50 items.
- Krylov subspace methods for the Dirac equation (Q310844) (← links)
- A new approach for determining the time step when propagating with the Lanczos algorithm (Q548942) (← links)
- On orthogonal polynomials with perturbed recurrence relations (Q749799) (← links)
- Newton sum rules of zeros of semiclassical orthogonal polynomials (Q750092) (← links)
- An improved Lanczos algorithm for solving ill-conditioned linear equations (Q805137) (← links)
- The joint bidiagonalization process with partial reorthogonalization (Q820739) (← links)
- Abstract perturbed Krylov methods (Q886144) (← links)
- A survey of Lanczos procedures for very large real 'symmetric' eigenvalue problems (Q1062424) (← links)
- Analysis of the symmetric Lanczos algorithm with reorthogonalization methods (Q1067356) (← links)
- Zero and negative masses in finite element vibration and transient analysis (Q1072776) (← links)
- An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A (Q1090063) (← links)
- Transient probabilistic systems (Q1090154) (← links)
- A two-step iterative block Lanczos algorithm for a dominant eigenspan (Q1094817) (← links)
- Accelerated simultaneous iterations for large finite element eigenproblems (Q1115098) (← links)
- The Lanczos phenomenon - An interpretation based upon conjugate gradient optimization (Q1135080) (← links)
- The block conjugate gradient algorithm and related methods (Q1136195) (← links)
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations (Q1138344) (← links)
- An accelerated subspace iteration method (Q1142087) (← links)
- Computational methods of linear algebra (Q1148099) (← links)
- Lanczos method of tridiagonalization, Jacobi matrices and physics (Q1155942) (← links)
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem (Q1157667) (← links)
- Computing eigenvalues of very large symmetric matrices. An implementation of a Lanczos algorithm with no reorthogonalization (Q1161032) (← links)
- Quadratically constrained least squares and quadratic problems (Q1180757) (← links)
- Iterative eigenvalue algorithms based on convergent splittings (Q1224853) (← links)
- Hierarchical clustering from principal coordinates: An efficient method for small to very large numbers of objects (Q1229180) (← links)
- On the numerical solution of the eigenvalue problem of the Laplace operator by a capacitance matrix method (Q1255772) (← links)
- A high-precision study of anharmonic-oscillator spectra (Q1283695) (← links)
- Recursive tridiagonalization of infinite dimensional Hamiltonians (Q1330612) (← links)
- Estimates in quadratic formulas (Q1344109) (← links)
- A stable Stieltjes technique for computing orthogonal polynomials and Jacobi matrices associated with a class of singular measures (Q1357542) (← links)
- A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix (Q1365898) (← links)
- Determination of eigenstates via Lanczos-based forward substitution and filter- diagonalization (Q1372009) (← links)
- Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices (Q1399640) (← links)
- A projection method for generalized eigenvalue problems using numerical integration. (Q1410848) (← links)
- New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem (Q1578093) (← links)
- Lanczos algorithm and energy-weighted sum rules for linear response (Q1613832) (← links)
- Fitting large-scale structured additive regression models using Krylov subspace methods (Q1658522) (← links)
- On the computation of a very large number of eigenvalues for selfadjoint elliptic operators by means of multigrid methods (Q1869854) (← links)
- Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices (Q1871007) (← links)
- Numerical stability of GMRES (Q1904273) (← links)
- Iterative methods for the computation of a few eigenvalues of a large symmetric matrix (Q1923866) (← links)
- On computing Jacobi matrices associated with recurrent and Möbius iterated function systems (Q1971843) (← links)
- Theoretical error bounds on the convergence of the Lanczos and block-Lanczos methods (Q1972461) (← links)
- Frequency domain resilient consensus of multi-agent systems under IMP-based and non IMP-based attacks (Q2097736) (← links)
- An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process (Q2451655) (← links)
- Fractal measures and polynomial sampling: I.F.S.-Gaussian integration (Q2458335) (← links)
- Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems (Q2493739) (← links)
- A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method (Q2654201) (← links)
- \textit{TimeEvolver}: a program for time evolution with improved error bound (Q2701209) (← links)
- A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems (Q2818245) (← links)
