On Moore-Penrose pseudoinverse computation for stiffness matrices resulting from higher order approximation (Q2298508)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On Moore-Penrose pseudoinverse computation for stiffness matrices resulting from higher order approximation |
scientific article; zbMATH DE number 7170920
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Moore-Penrose pseudoinverse computation for stiffness matrices resulting from higher order approximation |
scientific article; zbMATH DE number 7170920 |
Statements
On Moore-Penrose pseudoinverse computation for stiffness matrices resulting from higher order approximation (English)
0 references
20 February 2020
0 references
Summary: Computing the pseudoinverse of a matrix is an essential component of many computational methods. It arises in statistics, graphics, robotics, numerical modeling, and many more areas. Therefore, it is desirable to select reliable algorithms that can perform this operation efficiently and robustly. A demanding benchmark test for the pseudoinverse computation was introduced. The stiffness matrices for higher order approximation turned out to be such tough problems and therefore can serve as good benchmarks for algorithms of the pseudoinverse computation. It was found out that only one algorithm, out of five known from literature, enabled us to obtain acceptable results for the pseudoinverse of the proposed benchmark test.
0 references
0 references
0 references
0.7047549486160278
0 references
0.7041828632354736
0 references