Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.17606

Fully discrete scheme for the fifth-order KdV-Burgers-Fisher equation using Strang splitting and Fourier collocation methods

Nurcan Gücüyenen Kaymak·Fatma Zürnacı-Yetiş·Muaz Seydaoğlu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Operator splitting is an effective technique for the numerical solution of nonlinear partial differential equations by decomposing a complex problem into simpler subproblems. In this study, we present and analyze a fully discrete scheme for the fifth-order Korteweg-de Vries-Burgers-Fisher equation (KBF) by combining Strang splitting for time discretization with the Fourier collocation method for spatial discretization. In particular, the Fourier collocation method is an essential component of the proposed fully discrete scheme and yields spectral accuracy in space under suitable regularity assumptions. The KBF equation describes the interaction of reaction, dissipative, and dispersive mechanisms by incorporating the Fisher reaction term together with Burgers-type diffusion and higher-order KdV dispersion. The equation is split into a linear operator and a nonlinear operator, and the resulting subproblems are solved within the Strang splitting framework. Convergence is analyzed in the Sobolev space $H^s$. The local error is derived using operator-theoretic arguments in Banach spaces together with Lie commutator estimates, while the global error is obtained using the Lady Windermere's fan argument. The analysis yields second-order convergence in time and spectral convergence in space. Numerical results confirm the theoretical error estimates and demonstrate the accuracy of the proposed fully discrete scheme.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nurcan Gücüyenen Kaymak, Fatma Zürnacı-Yetiş, Muaz Seydaoğlu. 2026-04-19. Fully discrete scheme for the fifth-order KdV-Burgers-Fisher equation using Strang splitting and Fourier collocation methods. https://arxiv.org/abs/2604.17606

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

KEEP EXPLORING

Related papers

arXiv2026

Cost-Accuracy Trade-offs: Neural Operator vs Classical Numerical Solver

Neural operators are data-driven models that learn mappings from inputs that parameterize partial differential equations, such as spatially varying coefficients, initial conditions, forcing terms, boundary conditions, or geometries, to solution fields or quantities of interest. Once trained, they can serve as surrogates for classical numerical solvers in many-query settings that require repeated evaluations for varying inputs. We address the question of when, and then why, neural operator surrogates outperform classical numerical solvers, in terms of cost for a given accuracy. We focus on the post-training, many-query limit, in which data-acquisition and training costs are treated as fixed and fully amortized. Even in this deliberately favorable regime for neural operators, there are regimes in which classical solvers outperform the surrogate models. We compare the cost-accuracy performance of neural operator surrogates and classical numerical solvers through a reproducible benchmark study comparing neural operators with problem-matched classical solvers on representative problems in computational science and engineering, focusing on prediction error, per-query floating-point cost, and wall-clock runtime. Neural operators are most competitive at low-to-moderate accuracy requirements. Their floating-point cost advantage depends strongly on the problem structure, arising when they avoid temporal or nonlinear iterations or predict a reduced quantity of interest rather than a full solution field. Additional wall-clock speedups result from dense tensor operations that are well suited to modern hardware. As the target accuracy is tightened, achieving the required accuracy with neural operators becomes increasingly challenging, and classical solvers outperform surrogates in this regime; thus classical solvers will remain important for verification and high-accuracy computation.

math.NA↗
arXiv2026

Learning to Integrate

We address uncertainty quantification for a generic input distribution to some resource-intensive simulation, e.g., requiring the solution of a partial differential equation. While efficient numerical methods exist to compute integrals for high-dimensional Gaussian and other separable distributions based on sparse grids (SG), input data arising in practice often does not fall into this class. We therefore employ transport maps to transform complex distributions to multivariate standard normals. In generative learning, a number of neural network architectures have been introduced that accomplish this task approximately. Examples are affine coupling flows (ACF) and ordinary differential equation-based networks such as conditional flow matching (CFM). To compute the expectation of a quantity of interest, we numerically integrate the composition of the inverse of the learned transport map with the simulation code output. As this map is integrated over a multivariate Gaussian distribution, SG techniques can be applied. Viewing the images of the SG quadrature nodes as learned quadrature nodes for a given complex distribution motivates our title. We demonstrate our method for monomials of total degrees for which the unmapped SG rules are exact. We also apply our approach to the stationary diffusion equation with coefficients modeled by exponentiated Lévy random fields, using modal expansions of Karhunen--Loève type with 9 and 25 modes. In a series of numerical experiments, we investigate errors due to learning accuracy, quadrature, statistical estimation, truncation of the modal series of the input random field, and training data size for three normalizing flows (ACF, conditional flow matching and optimal transport flow matching). We discuss the mathematical assumptions on which our approach is based and demonstrate its shortcomings when these are violated.

math.NA↗
arXiv2026

Variational estimates for Schur complements of symmetric saddle point problems

We present sharp variational estimates for the extremal eigenvalues of Schur complements arising in symmetric saddle point problems. These estimates make explicit the role of right inverses with controlled energy in lower bounds and of null space corrections in upper bounds. The same argument applies to projected Schur complements when the primal operator is semidefinite. Applications to the augmented Lagrangian method, mixed finite element methods, and nonoverlapping domain decomposition methods yield concise proofs of established convergence estimates.

math.NA↗