Integrating Lipschitzian dynamical systems using piecewise algorithmic differentiation

@article{Griewank2017IntegratingLD,
  title={Integrating Lipschitzian dynamical systems using piecewise algorithmic differentiation},
  author={Andreas Griewank and Richard Hasenfelder and Manuel Radons and Lutz Lehmann and Thomas Streubel},
  journal={Optimization Methods and Software},
  year={2017},
  volume={33},
  pages={1089 - 1107}
}
In this article we analyse a generalized trapezoidal rule for initial value problems with piecewise smooth right-hand side based on a generalization of algorithmic differentiation. When applied to such a problem, the classical trapezoidal rule suffers from a loss of accuracy if the solution trajectory intersects a nondifferentiability of F. The advantage of the proposed generalized trapezoidal rule is threefold: Firstly, we can achieve a higher convergence order than with the classical method… 

Piecewise linear secant approximation via algorithmic piecewise differentiation

A generalized Newton's method based on successive piecewise linearization is devised and sufficient conditions for convergence and convergence rates equalling those of semismooth Newton are proved.

Piecewise Polynomial Taylor Expansions—The Generalization of Faà di Bruno’s Formula

We present an extension of Taylor’s theorem towards nonsmooth evaluation procedures incorporating absolute value operaions. Evaluations procedures are computer programs of mathematical functions in

On the abs-polynomial expansion of piecewise smooth functions

It is shown that the Moore recurrences can be adapted for regular intrinsics to the abs-normal case and extended to infinite series that converge absolutely on spherical domains.

Sign controlled solvers for the absolute value equation with an application to support vector machines

Three solvers are presented: One direct, one semi-iterative and one discrete variant of damped Newton, and their previously proved ranges of correctness and convergence, respectively, are extended.

Taylor subsumes Scott, Berry, Kahn and Plotkin

This paper provides simple proofs of important results in λ-calculus that are usually demonstrated by exploiting Scott's continuity, Berry's stability or Kahn and Plotkin's sequentiality theory, but relying on the main properties of resource approximants.

An Open Newton Method for Piecewise Smooth Functions

Recent research has shown that piecewise smooth (PS) functions can be approximated by piecewise linear functions with second order error in the distance to a given reference point. A semismooth

Generic Construction and Efficient Evaluation of Flow Network DAEs and Their Derivatives in the Context of Gas Networks

We present a concept that provides an efficient description of differential-algebraic equations (DAEs) describing flow networks which provides the DAE function \(f\) and their Jacobians in an

References

SHOWING 1-10 OF 20 REFERENCES

On stable piecewise linearization and generalized algorithmic differentiation

It is shown how functions that are defined by evaluation programs involving the absolute value function abs() (besides smooth elementals) can be approximated locally by piecewise-linear models in the

Piecewise linear secant approximation via algorithmic piecewise differentiation

A generalized Newton's method based on successive piecewise linearization is devised and sufficient conditions for convergence and convergence rates equalling those of semismooth Newton are proved.

GEOMETRIC INTEGRATORS FOR PIECEWISE SMOOTH HAMILTONIAN SYSTEMS

In this paper, we consider C 1,1 Hamiltonian systems. We prove the existence of a first derivative of the flow with respect to initial values and show that it satisfies the symplecticity condition

Direct solution of piecewise linear systems

  • Manuel Radons
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 2016

Evaluating derivatives - principles and techniques of algorithmic differentiation, Second Edition

This second edition has been updated and expanded to cover recent developments in applications and theory, including an elegant NP completeness argument by Uwe Naumann and a brief introduction to scarcity, a generalization of sparsity.

Representation and Analysis of Piecewise Linear Functions in Abs-Normal Form

The system of equations \(F(x) = 0\) can be rewritten in terms of the variable vector \(z\) as a linear complementarity problem (LCP) and the transformation itself and the properties of the LCP depend on the Schur complement.

Ordinary Differential Equations

Foreword to the Classics Edition Preface to the First Edition Preface to the Second Edition Errata I: Preliminaries II: Existence III: Differential In qualities and Uniqueness IV: Linear Differential

The Art of Differentiating Computer Programs - An Introduction to Algorithmic Differentiation

  • U. Naumann
  • Computer Science
    Software, environments, tools
  • 2012
This is the first entry-level book on algorithmic differentiation (AD), providing fundamental rules for the generation of first- and higher-order tangent-linear and adjoint code.

A new class of energy-preserving numerical integration methods

The first ever energy-preserving B-series numerical integration method for (ordinary) differential equations is presented and applied to several Hamiltonian systems. Related novel Lie algebraic