Pages that link to "Item:Q3006031"
From MaRDI portal
The following pages link to Numerical Methods for Large Eigenvalue Problems (Q3006031):
Displaying 50 items.
- Block tensor train decomposition for missing data estimation (Q1757240) (← links)
- A numerical method of determining eigenvalues of matrices of arbitrary large size (Q1780254) (← links)
- The numerical rank of Krylov matrices (Q1789397) (← links)
- Towards backward perturbation bounds for approximate dual Krylov subspaces (Q1944009) (← links)
- A spectral Newton-Schur algorithm for the solution of symmetric generalized eigenvalue problems (Q1988487) (← links)
- A model order reduction technique for systems with nonlinear frequency dependent damping (Q1988805) (← links)
- The power method and beyond (Q1995934) (← links)
- A numerical study of fractional linear algebraic systems (Q1998393) (← links)
- A contour-integral based method for counting the eigenvalues inside a region (Q1999893) (← links)
- Computing eigenpairs of Hermitian matrices in perfect Krylov subspaces (Q2009054) (← links)
- A Riemannian conjugate gradient method for optimization on the Stiefel manifold (Q2012231) (← links)
- A matrix-free isogeometric Galerkin method for Karhunen-Loève approximation of random fields using tensor product splines, tensor contraction and interpolation based quadrature (Q2021879) (← links)
- A variation of Broyden class methods using Householder adaptive transforms (Q2023660) (← links)
- Properties of the delayed weighted gradient method (Q2026769) (← links)
- Multilevel correction adaptive finite element method for solving nonsymmetric eigenvalue problems (Q2027784) (← links)
- On choices of formulations of computing the generalized singular value decomposition of a large matrix pair (Q2028035) (← links)
- Pseudoinverse graph convolutional networks. Fast filters tailored for large eigengaps of dense graphs and hypergraphs (Q2036767) (← links)
- On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems (Q2043198) (← links)
- Randomized block Krylov subspace methods for trace and log-determinant estimators (Q2045172) (← links)
- Randomized block Krylov methods for approximating extreme eigenvalues (Q2068363) (← links)
- The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem (Q2068644) (← links)
- Efficient semidefinite programming with approximate ADMM (Q2073055) (← links)
- Spatial and color hallucinations in a mathematical model of primary visual cortex (Q2073637) (← links)
- The numerical Jordan form (Q2074949) (← links)
- A method for computing a few eigenpairs of large generalized eigenvalue problems (Q2085682) (← links)
- Statistical modeling and an adaptive averaging technique for strong convergence of the dynamic mode decomposition (Q2088764) (← links)
- Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory (Q2100562) (← links)
- The INTERNODES method for applications in contact mechanics and dedicated preconditioning techniques (Q2107157) (← links)
- Strong consistency of the projected total least squares dynamic mode decomposition for datasets with random noise (Q2111579) (← links)
- Inexact inverse subspace iteration with preconditioning applied to quadratic matrix polynomials (Q2113853) (← links)
- Computing interior eigenvalues of large sparse symmetric matrices (Q2114504) (← links)
- A numerical method for the approximation of stable and unstable manifolds of microscopic simulators (Q2116058) (← links)
- A Hessenberg-type algorithm for computing PageRank problems (Q2118965) (← links)
- Complex-scaled infinite elements for resonance problems in heterogeneous open systems (Q2124740) (← links)
- Graph coarsening: from scientific computing to machine learning (Q2128866) (← links)
- Jacobi-Davidson method for the second order fractional eigenvalue problems (Q2129468) (← links)
- An active-set algorithm for norm constrained quadratic problems (Q2133422) (← links)
- A functional oriented truncation error adaptation method (Q2134797) (← links)
- A non-perturbative approach to computing seismic normal modes in rotating planets (Q2148132) (← links)
- Optical crystals and light-bullets in Kerr resonators (Q2169666) (← links)
- Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems (Q2174791) (← links)
- Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank (Q2175838) (← links)
- On the Kahan-Parlett-Jiang theorem -- a globally optimal backward perturbation error for two-sided invariant subspaces (Q2185840) (← links)
- Block subspace projection preconditioned conjugate gradient method in modal structural analysis (Q2192515) (← links)
- Basic reproduction numbers for a class of reaction-diffusion epidemic models (Q2195630) (← links)
- Lanczos-based fast blind deconvolution methods (Q2196034) (← links)
- An efficient exhaustive search algorithm for the Escherization problem (Q2196607) (← links)
- Elastic rods with incompatible strain: macroscopic versus microscopic buckling (Q2201054) (← links)
- On multistep Rayleigh quotient iterations for Hermitian eigenvalue problems (Q2203937) (← links)
- Numerical bifurcation analysis of a 3D Turing-type reaction-diffusion model (Q2207850) (← links)
