相关论文: A Root-Free Splitting-Lemma for Systems of Linear …

The reduction of Hamiltonian systems aims to build smaller reduced models, valid over a certain range of time and parameters, in order to reduce computing time. By maintaining the Hamiltonian structure in the reduced model, certain…

We develop a new symbolic-numeric algorithm for the certification of singular isolated points, using their associated local ring structure and certified numerical computations. An improvement of an existing method to compute inverse systems…

This paper concerns the construction and analysis of a numerical scheme for a mixed discrete-continuous fragmentation equation. A finite volume scheme is developed, based on a conservative formulation of a truncated version of the…

Differential-elimination algorithms apply a finite number of differentiations and eliminations to systems of partial differential equations. For systems that are polynomially nonlinear with rational number coefficients, they guarantee the…

Lie symmetry analysis is an established method for generating symmetries of differential equations. We apply this method together the generalized fundamental theorem of double reduction. In particular, Noether symmetries and some associated…

We consider linear iterative schemes for the time-discrete equations stemming from a class of nonlinear, doubly-degenerate parabolic equations. More precisely, the diffusion is nonlinear and may vanish or become multivalued for certain…

We develop a finite element method with continuous displacements and discontinuous rotations for the Mindlin-Reissner plate model on quadrilateral elements. To avoid shear locking, the rotations must have the same polynomial degree in the…

A new approach is discussed for solving large nonsymmetric systems of linear equations with multiple right-hand sides. The first system is solved with a deflated GMRES method that generates eigenvector information at the same time that the…

Traditional projection-based reduced-order modeling approximates the full-order model by projecting it onto a linear subspace. With a fast-decaying Kolmogorov $n$-width of the solution manifold, the resulting reduced-order model (ROM) can…

Matrix inversion problems are often encountered in experimental physics, and in particular in high-energy particle physics, under the name of unfolding. The true spectrum of a physical quantity is deformed by the presence of a detector,…

We develop an efficient numerical scheme for the 3D mean-field spherical dynamo equation. The scheme is based on a semi-implicit discretization in time and a spectral method in space based on the divergence-free spherical harmonic…

We define the notion of inseparable coverings of schemes and we propose a ramification formalism for them, along the lines of the classical one. Using this formalism we prove a formula analogous to the classical Riemann-Hurwitz formula for…

It was shown recently that stochastic quantization can be made into a well defined quantization scheme on (pseudo-)Riemannian manifolds using second order differential geometry, which is an extension of the commonly used first order…

In this paper we will give a scheme-theoretic discussion on the unramified extensions of an arithmetic function field in several variables. The notion of unramified discussed here is parallel to that in algebraic number theory and for the…

We consider Hamiltonian PDEs that can be split into a linear unbounded operator and a regular non linear part. We consider abstract splitting methods associated with this decomposition where no discretization in space is made. We prove a…

A method for compression of large graphs and non-negative matrices to a block structure is proposed. Szemer\'edi's regularity lemma is used as heuristic motivation of the significance of stochastic block models. Another ingredient of the…

The ability to differentiate through optimization problems has unlocked numerous applications, from optimization-based layers in machine learning models to complex design problems formulated as bilevel programs. It has been shown that…

We present a scalable tensor-based approach to computing input-normal/output-diagonal nonlinear balancing transformations for control-affine systems with polynomial nonlinearities. This transformation is necessary to determine the states…

This a first step to develop a theory of smooth, etale and unramified morphisms between noetherian formal schemes. Our main tool is the complete module of differentials, that is a coherent sheaf whenever the map of formal schemes is of…

We present a general framework to represent discrete configuration systems using hypergraphs. This representation allows one to transfer combinatorial removal lemmas to their analogues for configuration systems. These removal lemmas claim…