Live briefing
Everything about Frontal solver
A frontal solver is an approach to solving sparse linear systems which is used extensively in finite element analysis. Algorithms of this kind are variants of Gauss elimination that automatically avoids a large number of operations involving zero terms due to the fact that the matrix is only sparse. The development of frontal solvers is usually considered as dating back to work by Bruce Irons. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Frontal solverA 5-minute orientation
- Pick up a classic book: The design of a parallel frontal solverThe most-reprinted book on the subject
- Read the landmark paper: A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic SchedulingCited 1,969 times
- Go sideways: Skyline matrixA closely related topic
- Go sideways: Sparse matrixA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
A frontal solver tuned for fully coupled non‐linear hygro‐thermo‐mechanical problems
Parallel multi-frontal solver for p adaptive finite element modeling of multi-physics computational problems
Graph Grammar based Multi-thread Multi-frontal Direct Solver with Galois Scheduler
A parallel frontal solver on the alliant FX/80
A parallel frontal solver for finite element applications
Parallel frontal solver for large‐scale process simulation and optimization
Dynamic Programming Algorithm for Generation of Optimal Elimination Trees for Multi-frontal Direct Solver Over H-refined Grids
📚 Books worth reading
- 📕The design of a parallel frontal solverJ. A. Scott · 1999
- 📕Parallel frontal solvers for large sparse linear systemsJ. A. Scott · 2002
- 📕Two-stage ordering for unsymmetric parallel row-by-row frontal solversJ.A Scott · 2000
- 📕A partitioned frontal solver and its application to material nonlinearityAlaeddin Alizadeh · 1978
- 📕The design of a portable parallel frontal solver for chemical process engineering problemsJ. A. Scott · 2001
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Skyline matrix In scientific computing, skyline matrix storage, or SKS, or a variable band matrix storage, or envelope storage scheme is a form of a sparse matrix storage…
- Sparse matrix In numerical analysis and scientific computing, a sparse matrix or sparse array is a matrix in which most of the elements are zero. There is no strict…
- Numerical linear algebra Numerical linear algebra, sometimes called applied linear algebra, is the study of how matrix operations can be used to create computer algorithms which…
- Mixed finite element method In numerical analysis, a mixed finite element method, is a variant of the finite element method in which extra fields to be solved are introduced during…
- List of numerical analysis topics This is a list of numerical analysis topics. Validated numerics Iterative method Rate of convergence — the speed at which a convergent sequence approaches…
- Symbolic Cholesky decomposition In the mathematical subfield of numerical analysis the symbolic Cholesky decomposition is an algorithm used to determine the non-zero pattern for the L…
- Cholesky decomposition In linear algebra, the Cholesky decomposition or Cholesky factorization (pronounced /ʃəˈlɛski/ shə-LES-kee) is a decomposition of a Hermitian, positive-definite…
- LU decomposition In numerical analysis and linear algebra, lower–upper (LU) decomposition or factorization factors a matrix as the product of a lower triangular matrix…