Exploiting symmetry in solving linear equations
[For the entire collection see Zbl 0745.00023.] The computational effort to the numerical treatment of certain partial differential equations can be reduced if the discretization is suitable adapted to respect symmetry properties which yield highly useful decompositions. The paper deals with the problem of solving linear equations coming from discretization methods, in the presence of a group action. The given linear problem is decomposed in a most efficient way into block form, in a direct manner, without first determining bases for the corresponding subspaces. The method can also be expressed in terms of tensor products.
- Solving a system of algebraic equations with symmetries
- scientific article; zbMATH DE number 13124
- scientific article; zbMATH DE number 5026761
- scientific article; zbMATH DE number 1349188
- On the symmetric solutions of a linear matrix equation
- On the symmetric solutions of linear matrix equations
- A symmetric linear system solver
- scientific article; zbMATH DE number 515689
- Linearization through symmetries for discrete equations
- Accurate Symmetric Indefinite Linear Equation Solvers
- Applications of the generalized Fourier transform in numerical linear algebra
- Some considerations about the symmetrical equations
- Groups and symmetries in numerical linear algebra
- scientific article; zbMATH DE number 5507529 (Why is no real title available?)
- Exploiting Symmetry in Boundary Element Methods
- scientific article; zbMATH DE number 953005 (Why is no real title available?)
- A Numerical Liapunov-Schmidt Method with Applications to Hopf Bifurcation on a Square
This page was built for publication: Exploiting symmetry in solving linear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4026623)
