2007
DOI: 10.1016/j.amc.2007.01.058
|View full text |Cite
|
Sign up to set email alerts
|

Picard iteration algorithm combined with Gauss–Seidel technique for initial value problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
33
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 22 publications
(34 citation statements)
references
References 11 publications
1
33
0
Order By: Relevance
“…The idea in [21,26] is to set up an iteration between a linear least squares optimization and a forward solution, which is partly based on a Picard iteration [34]. This approach is therefore distinctively different from other integral formulations like the modulating function approach [35] which does not iterate and is therefore not directly suitable for the discrete data and high non-linearities present in this application.…”
Section: Unique Parameter Identificationmentioning
confidence: 99%
See 1 more Smart Citation
“…The idea in [21,26] is to set up an iteration between a linear least squares optimization and a forward solution, which is partly based on a Picard iteration [34]. This approach is therefore distinctively different from other integral formulations like the modulating function approach [35] which does not iterate and is therefore not directly suitable for the discrete data and high non-linearities present in this application.…”
Section: Unique Parameter Identificationmentioning
confidence: 99%
“…Step 5 If the maximum volumes and aortic pressures are matched within a given tolerance to data in Equation (34), go to Step 6, otherwise go back to Step 3.…”
Section: Fig 3 -Parameter Identification Algorithm Formentioning
confidence: 99%
“…A Picard iteration is capable of solving non-linear systems using discretised transforms of the governing ODEs [28,29]. In this case, the iteration uses updating predictions of the Y(t) profile to converge to a highly accurate Y(t).…”
Section: (T) and A Picard Iteration To Find Y(t)mentioning
confidence: 99%
“…These equations can be readily solved by linear least squares to give an initial estimate for the value of n L . For this given value of n L , Equations (3) and (4) are then numerically solved using a Picard iteration [28,29] …”
Section: (T) and A Picard Iteration To Find Y(t)mentioning
confidence: 99%
“…The first three are linear, and the rests are nonlinear. The second, fourth and sixth systems are also used in [5,6] as the test problems for comparing different numerical methods. The exact solutions to the six ODEs are shown in fig.…”
Section: Numerical Examplesmentioning
confidence: 99%