Related papers: Normal BGG solutions and polynomials
We propose in this paper a Proper Generalized Decomposition (PGD) solver for reduced-order modeling of linear elastodynamic problems. It primarily focuses on enhancing the computational efficiency of a previously introduced PGD solver based…
To integer programming problems, computational algebraic approaches using Grobner bases or standard pairs via the discreteness of toric ideals have been studied in recent years. Although these approaches have not given improved time…
Partial Differential Equations (PDEs) underpin many scientific phenomena, yet traditional computational approaches often struggle with complex, nonlinear systems and irregular geometries. This paper introduces the AMG method, a Multi-Graph…
Many statistical models are algebraic in that they are defined by polynomial constraints or by parameterizations that are polynomial or rational maps. This opens the door for tools from computational algebraic geometry. These tools can be…
A real univariate polynomial of degree $n$ is called hyperbolic if all of its $n$ roots are on the real line. Such polynomials appear quite naturally in different applications, for example, in combinatorics and optimization. The focus of…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
The purpose of this paper is to investigate the well-posedness of several linear and nonlinear equations with a parabolic forward-backward structure, and to highlight the similarities and differences between them. The epitomal linear…
We propose a new high order accurate nodal discontinuous Galerkin (DG) method for the solution of nonlinear hyperbolic systems of partial differential equations (PDE) on unstructured polygonal Voronoi meshes. Rather than using classical…
We construct bounded Poincar\'e operators for twisted complexes and BGG complexes with a wide class of function classes (e.g., Sobolev spaces) on bounded Lipschitz domains. These operators are derived from the de Rham versions using BGG…
As a first step towards a theory of differential equations involving para-Grassmann variables the linear equations with constant coefficients are discussed and solutions for equations of low order are given explicitly. A connection to…
Using parametrized curves (Section 1) or parametrized sheets (Section 3), and suitable metrics, we treat the jet bundle of order one as a semi-Riemann manifold. This point of view allows the description of solutions of DEs as pregeodesics…
In this work, we study the convergence and performance of nonlinear solvers for the Bidomain equations after decoupling the ordinary and partial differential equations of the cardiac system. Firstly, we provide a rigorous proof of the…
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…
Renormalisation group flows of the bosonic nonlinear \sigma-model are governed, perturbatively, at different orders of \alpha', by the perturbatively evaluated \beta--functions. In regions where \frac{\alpha'}{R_c^2} << 1 the flow equations…
We present a method for nonlinear parametric optimization based on algebraic geometry. The problem to be studied, which arises in optimal control, is to minimize a polynomial function with parameters subject to semialgebraic constraints.…
In recent years, progress toward the classification of superintegrable systems with higher order integrals of motion has been made. In particular, a complete classification of all exotic potentials with a third or a fourth order integrals,…
In this paper we construct examples of commuting ordinary scalar differential operators with polynomial coefficients that are related to a spectral curve of an arbitrary genus g>0 and to an arbitrary rank r>1 of the vector bundle of common…
We identify a common scheme in several existing algorithms addressing computational problems on linear differential equations with polynomial coefficients. These algorithms reduce to computing a linear relation between vectors obtained as…
Optimization under structural constraints is typically analyzed through projection or penalty methods, obscuring the geometric mechanism by which constraints shape admissible dynamics. We propose an operator-theoretic formulation in which…
Frame bundles equipped with a principal connection have their local structure characterised by a 1-form, called the Cartan connection 1-form, which gathers the principal connection form and the soldering form. We introduce generalised frame…