An Adaptive Fast Solver for a General Class of Positive Definite Matrices Via Energy Decomposition

DOI10.1137/17M1140686zbMath1391.65066arXiv1707.08277OpenAlexW2963244551MaRDI QIDQ4643812

Ka Chun Lam, Pengchuan Zhang, De Huang, Thomas Yizhao Hou

Publication date: 29 May 2018

Published in: Multiscale Modeling & Simulation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.08277

zbMATH Keywords

fast solvergraph Laplacianoperator compressionenergy decompositionmultiresolution matrix decomposition

Mathematics Subject Classification ID

Factorization of matrices (15A23) Graph theory (including graph drawing) in computer science (68R10) Positive matrices and their generalizations; cones of matrices (15B48) Iterative numerical methods for linear systems (65F10)

Related Items (9)

Numerical homogenization beyond scale separation ⋮ Contrast-independent partially explicit time discretizations for multiscale flow problems ⋮ Contrast-independent partially explicit time discretizations for multiscale wave problems ⋮ Partially explicit time discretization for nonlinear time fractional diffusion equations ⋮ Commutation of geometry-grids and fast discrete PDE eigen-solver GPA ⋮ Hybrid explicit-implicit learning for multiscale problems with time dependent source ⋮ Sparse Compression of Expected Solution Operators ⋮ A Fast Hierarchically Preconditioned Eigensolver Based on Multiresolution Matrix Decomposition ⋮ Partially explicit time discretization for time fractional diffusion equation

Uses Software

• LAMG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse operator compression of higher-order elliptic operators with rough coefficients
• Adaptive variational multiscale methods based on a posteriori error estimation: energy norm estimates for elliptic problems
• Additive Schwarz domain decomposition methods for elliptic problems on unstructured meshes
• Principal component analysis.
• Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
• A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
• Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
• Multigrid with Rough Coefficients and Multiresolution Operator Decomposition from Hierarchical Information Games
• Numerical Methods for Large Eigenvalue Problems
• Principal warps: thin-plate splines and the decomposition of deformations
• Spectral Sparsification of Graphs
• Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
• A Parallel Geometric Multigrid Method for Finite Elements on Octree Meshes
• Localization of elliptic multiscale problems
• Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
• A Nearly-m log n Time Solver for SDD Linear Systems
• A Direct Formulation for Sparse PCA Using Semidefinite Programming
• A review of algebraic multigrid
• Geometric multigrid with applications to computational fluid dynamics

This page was built for publication: An Adaptive Fast Solver for a General Class of Positive Definite Matrices Via Energy Decomposition