An efficient shooting algorithm for Evans function calculations in large systems

In Evans function computations of the spectra of asymptotically constant-coefficient linear operators, a basic issue is the efficient and numerically stable computation of subspaces evolving according to the associated eigenvalue ODE. For small systems, a fast, shooting algorithm may be obtained by representing subspaces as single exterior products \cite{AS,Br.1,Br.2,BrZ,BDG}. For large systems, however, the dimension of the exterior-product space quickly becomes prohibitive, growing as $\binom{n}{k}$, where $n$ is the dimension of the system written as a first-order ODE and $k$ (typically $\sim n/2$) is the dimension of the subspace. We resolve this difficulty by the introduction of a simple polar coordinate algorithm representing ``pure'' (monomial) products as scalar multiples of orthonormal bases, for which the angular equation is a numerically optimized version of the continuous orthogonalization method of Drury--Davey \cite{Da,Dr} and the radial equation is evaluable by quadrature. Notably, the polar-coordinate method preserves the important property of analyticity with respect to parameters.Comment: 21 pp., two figure

Fast Order Basis and Kernel Basis Computation and Related Problems

In this thesis, we present efficient deterministic algorithms for polynomial matrix computation problems, including the computation of order basis, minimal kernel basis, matrix inverse, column basis, unimodular completion, determinant, Hermite normal form, rank and rank profile for matrices of univariate polynomials over a field. The algorithm for kernel basis computation also immediately provides an efficient deterministic algorithm for solving linear systems. The algorithm for column basis also gives efficient deterministic algorithms for computing matrix GCDs, column reduced forms, and Popov normal forms for matrices of any dimension and any rank. We reduce all these problems to polynomial matrix multiplications. The computational costs of our algorithms are then similar to the costs of multiplying matrices, whose dimensions match the input matrix dimensions in the original problems, and whose degrees equal the average column degrees of the original input matrices in most cases. The use of the average column degrees instead of the commonly used matrix degrees, or equivalently the maximum column degrees, makes our computational costs more precise and tighter. In addition, the shifted minimal bases computed by our algorithms are more general than the standard minimal bases

Issures in Discontinuous High-Order Methods: Broadband Wave Computation and Viscous Boundary Layer Resolution

A new discontinuous formulation named Correction Procedure via Reconstruction (CPR) was developed for conservation laws. CPR is an efficient nodal differential formulation unifying the discontinuous Galerkin (DG), spectral volume (SV) and spectral difference (SD) methods, is easy to implement. In this thesis, we deal with two issues: the efficient computation of broadband waves, and the proper resolution of a viscous boundary layer with the high-order CPR method. A hybrid discontinuous space including polynomial and Fourier bases is employed in the CPR formulation in order to compute broad-band waves. The polynomial bases are used to achieve a certain order of accuracy, while the Fourier bases are able to exactly resolve waves at a certain frequency. Free-parameters introduced in the Fourier bases are optimized in order to minimize both dispersion and dissipation errors by mimicking the dispersion-relation-preserving (DRP) method for a one-dimensional wave problem. For the one-dimensional wave problem, the dispersion and dissipation properties and the optimization procedure are investigated through a wave propagation analysis. The optimization procedure is verified with a wave propagation analysis and several numerical tests. The two-dimensional wave behavior is investigated through a wave propagation analysis and the wave propagation properties are verified with a numerical test of the two-dimensional acoustic wave equation. In order to understand the mesh size requirement to resolve a viscous boundary layer using CPR method, grid resolution studies are performed. . It is well known that the mesh size, which is defined from non-dimensional wall distance y^+=1, gives accepted results to simulate viscous boundary layer problem for 2nd order finite volume method. For high-order CPR formulation, what grid size y^+ is required to match the results from the 2nd order finite volume method with y^+=1. 1D and 2D burger\u27s equation are used as the viscous boundary layer model problem. Skin friction is used as the indicator of accuracy for the resolution of a boundary layer. Keywords: (Correction Procedure via Reconstruction), A Hybrid Discontinuous Space, Wave Propagation Analysis, Grid Resolution Study, Method of Manufactured Solution

Predicting zero reductions in Gr\"obner basis computations

Since Buchberger's initial algorithm for computing Gr\"obner bases in 1965 many attempts have been taken to detect zero reductions in advance. Buchberger's Product and Chain criteria may be known the most, especially in the installaton of Gebauer and M\"oller. A relatively new approach are signature-based criteria which were first used in Faug\`ere's F5 algorithm in 2002. For regular input sequences these criteria are known to compute no zero reduction at all. In this paper we give a detailed discussion on zero reductions and the corresponding syzygies. We explain how the different methods to predict them compare to each other and show advantages and drawbacks in theory and practice. With this a new insight into algebraic structures underlying Gr\"obner bases and their computations might be achieved.Comment: 25 pages, 3 figure

Analysis of the computation of Gr\"obner bases and Gr\"obner degenerations via theory of signatures

The signatures of polynomials were originally introduced by Faug\`{e}re for the efficient computation of Gr\"obner bases [Fau02], and redefined by Arri-Perry [AP11] as the standard monomials modulo the module of syzygies. Since it is difficult to determine signatures, Vaccon-Yokoyama [VY17] introduced an alternative object called guessed signatures. In this paper, we consider a module $\mathrm{Gobs}(F)$ consisting of the equivalent classes of the guessed signatures for a tuple of polynomials $F$. This is the residue module $\mathrm{ini}_{\prec}(\mathrm{Syz}(\mathrm{LM}(F)))/\mathrm{ini}_{\prec}(\mathrm{Syz}(F))$ defined by the initial modules of the syzygy modules with respect to the Schreyer order. We first show that $F$ is a Gr\"obner basis if and only if $\mathrm{Gobs}(F)$ is the zero module. Then we find a necessity to compute divisions of S-polynomials to find Gr\"obner bases. We give examples of transitions of minimal free resolutions of $\mathrm{Gobs}(F)$ in a signature based algorithm. Finally, we show a connection between the module $\mathrm{Gobs}(F)$ and Gr\"obner degenerations.Comment: 22 page