Stability of approximate factorization with \(\theta\)-methods (Q1307242): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1022318619173 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1540199570 / rank | |||
Normal rank | |||
Latest revision as of 08:43, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stability of approximate factorization with \(\theta\)-methods |
scientific article |
Statements
Stability of approximate factorization with \(\theta\)-methods (English)
0 references
1 December 1999
0 references
It is known that the approximate factorization method is a viable alternative to the time splitting method for a class of problems. In order to know the effect of factorization on stability, the author considers here a simple method, vis., the \(\theta\)-method. Precise results are obtained which show the limitations of the approximate factorization approach. It is observed that approximate factorizations are only suited for restricted classes of problems where characteristics of the solution are more or less known in advance, so that stability can be well predicted.
0 references
time splitting method
0 references
approximate factorization method
0 references
stability
0 references
theta-method
0 references
