Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userComputing Unstructured and Structured Polynomial Pseudospectrum Approximations
58
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In many applications it is important to understand the sensitivity of eigenvalues of a matrix polynomial to perturbations of the polynomial. The sensitivity commonly is described by condition numbers or pseudospectra. However, the computation of pseudospectra of matrix polynomials is very demanding computationally. This paper describes a new approach to computing approximations of pseudospectra of matrix polynomials by using rank-one or projected rank-one perturbations. These perturbations are inspired by Wilkinsons analysis of eigenvalue sensitivity. This approach allows the approximation of both structured and unstructured pseudospectra. Computed examples show the method to perform much better than a method based on random rank-one perturbations both for the approximation of structured and unstructured (i.e., standard) polynomial pseudospectra.
rate research
Read More
Given a polynomial system f associated with a simple multiple zero x of multiplicity {mu}, we give a computable lower bound on the minimal distance between the simple multiple zero x and other zeros of f. If x is only given with limited accuracy, we propose a numerical criterion that f is certified to have {mu} zeros (counting multiplicities) in a small ball around x. Furthermore, for simple double zeros and simple triple zeros whose Jacobian is of normalized form, we define modified Newton iterations and prove the quantified quadratic convergence when the starting point is close to the exact simple multiple zero. For simple multiple zeros of arbitrary multiplicity whose Jacobian matrix may not have a normalized form, we perform unitary transformations and modified Newton iterations, and prove its non-quantified quadratic convergence and its quantified convergence for simple triple zeros.
In this paper, we study how to quickly compute the <-minimal monomial interpolating basis for a multivariate polynomial interpolation problem. We address the notion of reverse reduced basis of linearly independent polynomials and design an algorithm for it. Based on the notion, for any monomial ordering we present a new method to read off the <-minimal monomial interpolating basis from monomials appearing in the polynomials representing the interpolation conditions.
Polynomial preconditioning with the GMRES minimal residual polynomial has the potential to greatly reduce orthogonalization costs, making it useful for communication reduction. We implement polynomial preconditioning in the Belos package from Trilinos and show how it can be effective in both serial and parallel implementations. We further show it is a communication-avoiding technique and is a viable option to CA-GMRES for large-scale parallel computing.
The paper is devoted to the spectral analysis of effective preconditioners for linear systems obtained via a Finite Element approximation to diffusion-dominated convection-diffusion equations. We consider a model setting in which the structured finite element partition is made by equi-lateral triangles. Under such assumptions, if the problem is coercive, and the diffusive and convective coefficients are regular enough, then the proposed preconditioned matrix sequences exhibit a strong clustering at unity, the preconditioning matrix sequence and the original matrix sequence are spectrally equivalent, and the eigenvector matrices have a mild conditioning. The obtained results allow to show the optimality of the related preconditioned Krylov methods. %It is important to stress that The interest of such a study relies on the observation that automatic grid generators tend to construct equi-lateral triangles when the mesh is fine enough. Numerical tests, both on the model setting and in the non-structured case, show the effectiveness of the proposal and the correctness of the theoretical findings.
We introduce and investigate a series of models for an infection of a diplodiploid host species by the bacterial endosymbiont textit{Wolbachia}. The continuous models are characterized by partial vertical transmission, cytoplasmic incompatibility and fitness costs associated with the infection. A particular aspect of interest is competitions between mutually incompatible strains. We further introduce an age-structured model that takes into account different fertility and mortality rates at different stages of the life cycle of the individuals. With only a few parameters, the ordinary differential equation models exhibit already interesting dynamics and can be used to predict criteria under which a strain of bacteria is able to invade a population. Interestingly, but not surprisingly, the age-structured model shows significant differences concerning the existence and stability of equilibrium solutions compared to the unstructured model.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
