Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0704.0720

$C^r$-Lohner algorithm

D. Wilczak·P. Zgliczyński
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present a Lohner type algorithm for the computation of rigorous bounds for solutions of ordinary differential equations and its derivatives with respect to initial conditions up to arbitrary order. As an application we prove the existence of multiple invariant tori around some elliptic periodic orbits for the pendulum equation with periodic forcing and for Michelson system.

Explore related subjects

math.NAcs.NAmath.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

D. Wilczak, P. Zgliczyński. 2007-04-05. $C^r$-Lohner algorithm. https://arxiv.org/abs/0704.0720

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Uniform-in-time Strong Error Estimates of Tamed-FEM to Superlinear SPDEs driven by Multiplicative Noise

We establish sharp, uniform-in-time strong error estimates for a nonlinearity-explicit tamed finite element method (FEM) applied to a class of superlinear stochastic partial differential equations (SPDEs) driven by multiplicative noise, including the stochastic Allen--Cahn equation with a moderately thick interface. This tamed-FEM was first introduced in {\it Z. Liu and J. Shen, J. Sci. Comput., 109:Paper No. 61, 26, 2026} to ensure long-time unconditional stability and to preserve the Lyapunov structure of this class of SPDEs. We further prove that the scheme is exponentially ergodic and derive the convergence rate of the numerical invariant measure to the exact one in the Wasserstein-2 distance. Finally, we present numerical experiments that verify the ergodicity, sharpness, and time-independence of the strong convergence rates for this tamed-FEM.

math.NA↗
arXiv2026

Solution Analysis of Tensor Equation $\mathcal{A} \ltimes \mathcal{X} \ltimes \mathcal{B}= \mathcal{C}$ via Semi Tensor Product with t-product

Tensor equations involving both left and right tensor operators arise naturally in applications where multidimensional data are coupled through transformations acting from both sides. Motivated by the need to analyze such equations, this manuscript investigates a detailed solution analysis of $\mathcal{A}\ltimes \mathcal{X}\ltimes \mathcal{B} = \mathcal{C}$ via the semi-tensor product with the $t$-product. The manuscript provides a more general framework that includes, as a special case, the tensor equation $\mathcal{A}\ltimes\mathcal{X}=\mathcal{B}$ considered in \cite{J.FathitensorequationAX=BunderSTP}. Necessary and sufficient conditions are derived for the existence of vector and matrix valued solutions. Explicit compatibility conditions are established, and constructive Moore-Penrose-inverse-based algorithms are provided for the vector and matrix valued cases. The computational complexity and execution times are compared for Discrete Fourier Transform(DFT) and Fast Fourier Transform(FFT) based \(t\)-product implementations. The practical relevance of the proposed framework is further demonstrated through a color image deblurring application. Examples throughout illustrate the theoretical results.

math.NA↗
arXiv2026

A nonoverlapping spectral additive Schwarz method for interior penalty discontinuous Galerkin discretizations of Anisotropic Elliptic Problems

We design and analyze a nonoverlapping additive Schwarz preconditioner for interior penalty discontinuous Galerkin discretizations of anisotropic elliptic problems. The preconditioned method coupled with a Krylov subspace iteration is shown to be independent of the highly discontinuous (and anisotropic) jump coefficients as well as the subdomain size. To increase efficacy, various auxiliary spaces are considered to reduce the size of the coarse grid operator. We demonstrate how to modify the additive Schwarz preconditioner such that it is applicable to the nonsymmetric IPDG schemes. Several numerical experiments verify the theory and validate the robustness of the preconditioner.

math.NA↗