TIME-PARALLEL COMPUTATION OF PSEUDO-ADJOINTS FOR A LEAPFROG SCHEME (Q5692260): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Computing Large Sparse Jacobian Matrices Using Automatic Differentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational differentiation: techniques, applications, and tools / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Gradients in Large-Scale Optimization Using Automatic Differentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting intermediate sparsity in computing derivatives for a Leapfrog scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical approaches to automatic differentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recipes for adjoint code construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 755: ADOL-C / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3125550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 799: revolve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3125541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A truncated Newton optimization algorithm in meteorology applications with analytic Hessian/vector products / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129053304000219 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995666079 / rank
 
Normal rank

Latest revision as of 10:30, 30 July 2024

scientific article; zbMATH DE number 2209073
Language Label Description Also known as
English
TIME-PARALLEL COMPUTATION OF PSEUDO-ADJOINTS FOR A LEAPFROG SCHEME
scientific article; zbMATH DE number 2209073

    Statements

    TIME-PARALLEL COMPUTATION OF PSEUDO-ADJOINTS FOR A LEAPFROG SCHEME (English)
    0 references
    0 references
    0 references
    0 references
    27 September 2005
    0 references
    Automatic differentiation
    0 references
    combination of forward and reverse modes
    0 references
    leapfrog scheme
    0 references
    parallel computation
    0 references
    numerical examples
    0 references
    shallow water equations
    0 references
    difference scheme
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references