Triangularized orthogonalization-free method for solving extreme eigenvalue problems (Q2103436)

scientific article; zbMATH DE number 7632632

Language	Label	Description	Also known as
English	Triangularized orthogonalization-free method for solving extreme eigenvalue problems	scientific article; zbMATH DE number 7632632

Statements

instance of

scholarly article

0 references

title

Triangularized orthogonalization-free method for solving extreme eigenvalue problems (English)

0 references

0 references

0 references

0 references

Journal of Scientific Computing

0 references

publication date

13 December 2022

0 references

full work available at URL

https://arxiv.org/abs/2005.12161

0 references

zbMATH Keywords

eigenvalue problem

0 references

orthogonalization-free

0 references

iterative eigensolver

0 references

full configuration interaction

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

Optimization Methods for Large-Scale Machine Learning

0 references

Gradient Flow Based Kohn--Sham Density Functional Theory Model

0 references

The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices

0 references

A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints

0 references

Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints

0 references

Triangularized orthogonalization-free method for solving extreme eigenvalue problems

0 references

Q4917542

0 references

An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems

0 references

A Broyden Class of Quasi-Newton Methods for Riemannian Optimization

0 references

An accelerated conjugate gradient algorithm to compute low-lying eigenvalues -- a study for the Dirac operator in SU(2) lattice QCD

0 references

Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method

0 references

First-order methods almost always avoid strict saddle points

0 references

Rayleigh Quotient Based Optimization Methods for Eigenvalue Problems

0 references

Bold diagrammatic Monte Carlo in the lens of stochastic iterative methods

0 references

CoordinateWise Descent Methods for Leading Eigenvalue Problem

0 references

An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations

0 references

Orbital minimization method with \(\ell^{1}\) regularization

0 references

Preconditioning Orbital Minimization Method for Planewave Discretization

0 references

Computing several eigenpairs of Hermitian problems by conjugate gradient iterations

0 references

FEAST As A Subspace Iteration Eigensolver Accelerated By Approximate Spectral Projection

0 references

Q5563083

0 references

A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems

0 references

Numerical Methods for Electronic Structure Calculations of Materials

0 references

Existence and computation of generalized Wannier functions for non-periodic systems in two dimensions and higher

0 references

A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix

0 references

Trace-penalty minimization for large-scale eigenspace computation

0 references

A feasible method for optimization with orthogonality constraints

0 references

The vectorization of ITPACK 2C

0 references

ELSI: a unified software interface for Kohn-Sham electronic structure solvers

0 references

Gradient Type Optimization Methods For Electronic Structure Calculations

0 references

Self-consistent-field calculations using Chebyshev-filtered subspace iteration

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1007/S10915-022-02025-0

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2103436