AI & ML
Symmetric Zassenhaus splittings for bounded and unbounded operators
arXiv cs.NA0 views
arXiv:2611.09571v1 Announce Type: new Abstract: We establish rigorous local-error bounds for the entire family of symmetric Zassenhaus splittings for possibly unbounded operators, under explicit assumptions on commutator bounds, regularity-preserving flows, and conjugation identities. Truncated symmetric Baker-Campbell-Hausdorff expansions yield an explicit coefficient formula for the Zassenhaus exponents and identify vanishing commutator expressions. In order to extend these cancellations to the realm of unbounded operators, we prove a general theorem on finite expansions of multiple operator conjugations with controlled integral remainders. For splittings of order 2n, our argument gives the sufficient commutator-length bound 4n-1, revealing regularity requirements that are not apparent from the formal order calculation. Using the Schr\"odinger equation with a quadratic potential as an example, we show that the order-dependent regularity requirements can reduce to one fixed weighted Sobolev space for all splitting orders.
Source:https://arxiv.org/abs/2611.09571PreviousMathematical analysis and vectorized FEM implementation of logarithmic strain space framework for finite strains: a case study on elastoplasticityNextBayesian Inverse Problems for EUV reflectometry with regularized JKO scheme
Related posts
![Path Planning and Autonomous Navigation — Ch.24: Advanced Autonomous Behaviors [KR]](https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Farticles%2Fgmggiae4nyxpukfvgqba.png)
Path Planning and Autonomous Navigation — Ch.24: Advanced Autonomous Behaviors [KR]
0dev.to
화면이 사람을 붙잡는 힘 — AB 1709 소송이 개발자에게 던지는 질문
0dev.to
![Path Planning and Autonomous Navigation — Ch.12: Reversing and Parking [EN]](https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Farticles%2F1k9m20qhwzb1csyeu5v1.png)
Path Planning and Autonomous Navigation — Ch.12: Reversing and Parking [EN]
0dev.to
![Path Planning and Autonomous Navigation — Ch.13: Docking and Charging [EN]](https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Farticles%2Ff66zllmrqlif2vsyczxb.png)
Path Planning and Autonomous Navigation — Ch.13: Docking and Charging [EN]
0dev.to
![Path Planning and Autonomous Navigation — Ch.16: Rough Terrain Driving [EN]](https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Farticles%2Fmltd2hs9q5yutx3myjia.png)
Path Planning and Autonomous Navigation — Ch.16: Rough Terrain Driving [EN]
0dev.to

Implementing the Modern Data Strategy: Microsoft Fabric Blueprint
0dev.to