A New Optimality Property of Strang's Splitting

10/13/2022
by   Fernando Casas, et al.
0

For systems of the form q̇ = M^-1 p, ṗ = -Aq+f(q), common in many applications, we analyze splitting integrators based on the (linear/nonlinear) split systems q̇ = M^-1 p, ṗ = -Aq and q̇ = 0, ṗ = f(q). We show that the well-known Strang splitting is optimally stable in the sense that, when applied to a relevant model problem, it has a larger stability region than alternative integrators. This generalizes a well-known property of the common Störmer/Verlet/leapfrog algorithm, which of course arises from Strang splitting based on the (kinetic/potential) split systems q̇ = M^-1 p, ṗ = 0 and q̇ = 0, ṗ = -Aq+f(q).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/16/2023

Practical 3-splitting beyond Strang

Operator splitting is a popular divide-and-conquer strategy for solving ...
research
12/21/2021

Data blurring: sample splitting a single sample

Suppose we observe a random vector X from some distribution P in a known...
research
10/08/2018

Split-Correctness in Information Extraction

Programs for extracting structured information from text, namely informa...
research
10/12/2020

How Important is the Train-Validation Split in Meta-Learning?

Meta-learning aims to perform fast adaptation on a new task through lear...
research
05/04/2018

Fairness in Multiterminal Data Compression: A Splitting Method for The Egalitarian Solution

This paper proposes a novel splitting (SPLIT) algorithm to achieve fairn...
research
11/18/2022

Data Privacy in Multi-Cloud: An Enhanced Data Fragmentation Framework

Data splitting preserves privacy by partitioning data into various fragm...
research
01/01/2018

Sanskrit Sandhi Splitting using seq2(seq)^2

In Sanskrit, small words (morphemes) are combined through a morphophonol...

Please sign up or login with your details

Forgot password? Click here to reset