1987
DOI: 10.1063/1.2820230
|View full text |Cite
|
Sign up to set email alerts
|

Numerical Recipes: The Art of Scientific Computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
98
0

Year Published

1999
1999
2023
2023

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 103 publications
(98 citation statements)
references
References 0 publications
0
98
0
Order By: Relevance
“…Again, the nodal velocity field v n−1/2 is interpolated to these locations (3) and the resulting velocity field (green vector) is used to obtain trajectories backward in time (green) for a full time step t. The nodal velocity field v n−1 (pink) saved from the previous time step is interpolated to locations (4) and its solution is, together with the velocity field evaluations at the previous locations (1)-(3), used to obtain a weighted velocity field (see fourth equation in (28)); with this velocity field, the characteristics backward in time to points X are computed, nodal temperatures T(n, j) are interpolated to points X and assigned to nodes j. Adapted to backward in time from forward Runge-Kutta-4 description in Press (1992) and Spiegelman (2004).…”
Section: Semi-lagrangian Backward Characteristics For Heat Advectionmentioning
confidence: 99%
See 2 more Smart Citations
“…Again, the nodal velocity field v n−1/2 is interpolated to these locations (3) and the resulting velocity field (green vector) is used to obtain trajectories backward in time (green) for a full time step t. The nodal velocity field v n−1 (pink) saved from the previous time step is interpolated to locations (4) and its solution is, together with the velocity field evaluations at the previous locations (1)-(3), used to obtain a weighted velocity field (see fourth equation in (28)); with this velocity field, the characteristics backward in time to points X are computed, nodal temperatures T(n, j) are interpolated to points X and assigned to nodes j. Adapted to backward in time from forward Runge-Kutta-4 description in Press (1992) and Spiegelman (2004).…”
Section: Semi-lagrangian Backward Characteristics For Heat Advectionmentioning
confidence: 99%
“…We follow the approach of time step doubling presented in Press (1992) for our implementation of the adaptive time stepping routine. Its essence is to compare the computed solutions for the characteristics (3.3) when taking a trial full and two successive half time steps.…”
Section: Adaptive Runge-kutta-5 Time Steppingmentioning
confidence: 99%
See 1 more Smart Citation
“…The information of 2D features and locations of 2D bodypart blobs are used to reconstruct 3D human poses, through the methodology of analysis-by-synthesis, by fitting 2D features to 3D poses. The downhill simplex algorithm [47] is applied to minimize the cost function so as to find the optimal 3D human pose for each frame. The cost function is a measure of the difference between the 2D features and the 3D model projections; it is composed of the following four scores: silhouette score, edge score, motion score, and feature point score.…”
Section: D Pose Estimationmentioning
confidence: 99%
“…Note here that there are six degrees of freedom for controlling a virtual camera: a translational vector Tx,Ty,Tz, and rotational angle Rx,Ry,Rz. To adjust these parameters, we employ iterative calculations of a Simplex method 18 . We employ a coarse incremental step initially, and then gradually reduce the step size when the minimization of E with a step size reaches an oscillatory mode.…”
Section: Figure 10: Erroneous Correspondencementioning
confidence: 99%