相关论文: A normal form algorithm for the Brieskorn lattice

With a sufficiently fine discretisation, the Lattice Boltzmann Method (LBM) mimics a second order Crank-Nicolson scheme for certain types of balance laws (Farag et al. [2021]). This allows the explicit, highly parallelisable LBM to…

Spectral methods are now common in the solution of ordinary differential eigenvalue problems in a wide variety of fields, such as in the computation of black hole quasinormal modes. Most of these spectral codes are based on standard…

We associate to any convenient nondegenerate Laurent polynomial on the complex torus (C^*)^n a canonical Frobenius-Saito structure on the base space of its universal unfolding. According to the method of K. Saito (primitive forms) and of M.…

We present an alternative account of the problem of classifying and finding normal forms for arbitrary bilinear forms. Beginning from basic results developed by Riehm, our solution to this problem hinges on the classification of…

We present a generic scheme to construct corrected trapezoidal rules with spectral accuracy for integral operators with weakly singular kernels in arbitrary dimensions. We assume that the kernel factorization of the form,…

Most algorithms constructing bases of finite-dimensional vector spaces return basis vectors which, apart from orthogonality, do not show any special properties. While every basis is sufficient to define the vector space, not all bases are…

We give an overview on the tt*-geometry defined for isolated hypersurface singularities and tame functions via Brieskorn lattices. We discuss nilpotent orbits in this context, as well as classifying spaces of Brieskorn lattices and (limits…

We present economical iterative algorithms built on the Biconjugate $A$-Orthonormalization Procedure for real unsymmetric and complex non-Hermitian systems. The principal characteristics of the developed solvers is that they are fast…

Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. Many fundamental problems in interpolation and approximation give rise to…

The dual complex can be associated to any resolution of singularities whose exceptional set is a divisor with simple normal crossings. It generalizes to higher dimensions the notion of the dual graph of a resolution of surface singularity.…

This paper describes a trapezoidal quadrature method for the discretization of weakly singular, singular and hypersingular boundary integral operators with complex symmetric quadratic forms. Such integral operators naturally arise when…

We present a quite efficient method to calculate the roots of Bernstein-Sato polynomial for a defining polynomial $f$ of a projective hypersurface $Z\subset{\mathbb P}^{n-1}$ of degree $d$ having only weighted homogeneous isolated…

In this paper, we construct recollements and ladders for Brieskorn-Pham singularities via reduction/insertion functors, and study the singularity categories of the Brieskorn-Pham singularities using these ladders. In particular, we…

We use the monodromy method to investigate the asymptotic quasinormal modes of regular black holes based on the explicit Stokes portraits. We find that, for regular black holes with spherical symmetry and a single shape function, the…

A lattice Boltzmann method (LBM) with enhanced stability and accuracy is presented for various Hermite tensor-based lattice structures. The collision operator relies on a regularization step, which is here improved through a recursive…

In this paper we introduce the algorithm and the fixed point hardware to calculate the normalized singular value decomposition of a non-symmetric matrices using Givens fast (approximate) rotations. This algorithm only uses the basic…

There has been increasing interest in studying the Richardson model from which one can derive the exact solution for certain pairing Hamiltonians. However, it is still a numerical challenge to solve the nonlinear equations involved. In this…

The normal form for a system of ode's is constructed from its polynomial symmetries of the linear part of the system, which is assumed to be semi-simple. The symmetries are shown to have a simple structure such as invariant function times…

This paper introduces an algebraic combinatorial approach to simplicial cone decompositions, a key step in solving inhomogeneous linear Diophantine systems and counting lattice points in polytopes. We use constant term manipulation on the…

We prove that certain roots of the Bernstein-Sato polynomial (i.e. b-function) are jumping coefficients up to a sign, showing a partial converse of a theorem of L. Ein, R. Lazarsfeld, K.E. Smith, and D. Varolin. We also prove that certain…