A note on the necessary conditions for the algebraic Riccati equation

We derive some useful and easily computable necessary conditionsfor the existence of a positive semi-definite solution to thealgebraic Ricatti equation (ARE). A motivating example is givento highlight the usefulness of the conditions for controllerand observer designs for nonlinear systems. Further, an upperbound on the trace of the solution to the ARE is also derived.     

A two‐grid SA‐AMG convergence bound that improves when increasing the polynomial degree

In this paper, we consider the convergence rate of a smoothed aggregation algebraic multigrid method, which uses a simple polynomial (1 ? t)^ν or an optimal Chebyshev‐like polynomial to construct the smoother and prolongation operator. The result is purely algebraic, whereas a required main weak approximation property of the tentative interpolation operator is verified for a spectral element agglomeration version of the method. More specifically, we prove that, for partial differential equations (PDEs), the two‐grid method converges uniformly without any regularity assumptions. Moreover, the convergence rate improves uniformly when the degree of the polynomials used for the smoother and the prolongation increases. Such a result, as is well‐known, would imply uniform convergence of the multilevel W‐cycle version of the algorithm. Numerical results, for both PDE and non‐PDE (graph Laplacian) problems are presented to illustrate the theoretical findings. Published 2016. This article is a U.S. Government work and is in the public domain in the USA.     

Algebraic geometric codes with applications

The theory of linear error-correcting codes from algebraic geometric curves (algebraic geometric (AG) codes or geometric Goppa codes) has been well-developed since the work of Goppa and Tsfasman, Vladut, and Zink in 1981–1982. In this paper we introduce to readers some recent progress in algebraic geometric codes and their applications in quantum error-correcting codes, secure multi-party computation and the construction of good binary codes.      

The Waveform Relaxation method for systems of differential/algebraic equations

This paper reports efforts towards establishing a parallel numerical algorithm known as Waveform Relaxation (WR) for simulating large systems of differential/algebraic equations. The WR algorithm was established as a relaxation based iterative method for the numerical integration of systems of ODEs over a finite time interval. In the WR approach, the system is broken into subsystems which are solved independently, with each subsystem using the previous iterate waveform as “guesses” about the behavior of the state variables in other subsystems. Waveforms are then exchanged between subsystems, and the subsystems are then resolved repeatedly with this improved information about the other subsystems until convergence is achieved.

In this paper, a WR algorithm is introduced for the simulation of generalized high-index DAE systems. As with ODEs, DAE systems often exhibit a multirate behavior in which the states vary as differing speeds. This can be exploited by partitioning the system into subsystems as in the WR for ODEs. One additional benefit of partitioning the DAE system into subsystems is that some of the resulting subsystems may be of lower index and, therefore, do not suffer from the numerical complications that high-index systems do. These lower index subsystems may therefore be solved by less specialized simulations. This increases the efficiency of the simulation since only a portion of the problem must be solved with specially tailored code. In addition, this paper established solvability requirements and convergence theorems for varying index DAE systems for WR simulation.     

On the solution of a mixed nonlinear integral equation

In this paper, we consider a mixed nonlinear integral equation of the second kind in position and time. The existence of a unique solution of this equation is discussed and proved. A numerical method is used to obtain a system of Harmmerstein integral equations of the second kind in position. Then the modified Toeplitz matrix method, as a numerical method, is used to obtain a nonlinear algebraic system. Many important theorems related to the existence and uniqueness solution to the produced nonlinear algebraic system are derived. The rate of convergence of the total error is discussed. Finally, numerical examples when the kernel of position takes a logarithmic and Carleman forms, are presented and the error estimate, in each case, is calculated.     

Certain Diophantine Properties of the Mahler Measure

It is proved that a polynomial in several Mahler measures with positive rational coefficients is equal to an integer if and only if all these Mahler measures are integers. An estimate for the distance between a metric Mahler measure and an integer is obtained. Finally, it is proved that the ratio of two distinct Mahler measures of algebraic units is irrational.     

Algebraic cocycles on normal, quasi-projective varieties

This paper extends to quasi-projective varieties earlier work by the author and H. Blaine Lawson concerning spaces of algebraic cocycles on projective varieties. The topological monoid C_r(Y) (U) of effective cocycles on a normal, quasi-projective variety U with values in a projective variety Y consists of algebraic cycles on U×Y equi-dimensional of relative dimension r over U. A careful choice of topology enables the establishment of various good properties: the definition is essentially algebraic, the group completion Z_r (Y) (U) has 'sensible' homotopy groups, the construction is contravariant with respect to U, convariant with respect to Y, and there is a natural 'quality map" to the topological group of cycles on U×Y. The fundamental theorem presented here is the extension of Friedlander-Lawson duality to this context: the duality map Z_r (Y) (U) to Z_{_r+m} (U × Y) is a homotopy equivalence provided that both U and Y are smooth (where m=dim U). Various application are given, especially the determination of the homotopy types of certain topological groups of algeb raic morphisms.     

Convergence of multistep discretizations of DAEs

Standard ODE methods such as linear multistep methods encounter difficulties when applied to differential-algebraic equations (DAEs) of index greater than 1. In particular, previous results for index 2 DAEs have practically ruled out the use of all explicit methods and of implicit multistep methods other than backward difference formulas (BDFs) because of stability considerations. In this paper we embed known results for semi-explicit index 1 and 2 DAEs in a more comprehensive theory based on compound multistep and one-leg discretizations. This explains and characterizes the necessary requirements that a method must fulfill in order to be applicable to semi-explicit DAEs. Thus we conclude that the most useful discretizations are those that avoid discretization of the constraint. A freer use of e.g. explicit methods for the non-stiff differential part of the DAE is then possible.Dedicated to Germund Dahlquist on the occasion of his 70th birthdayThis author thanks the Centro de Estadística y Software Matemático de la Universidad Simón Bolivar (CESMa) for permitting her free use of its research facilities.Partial support by the Swedish Research Council for Engineering Sciences TFR under contract no. 222/91-405.     

线性空间上凸函数的可微性与次可微性

讨论了定义在线性空间上的广义实值凸函数的可做性和次可微性．     

Minimum Ellipsoid Bounds for Solutions of Polynomial Systems via Sum of Squares

We study ellipsoid bounds for the solutions of polynomial systems of equalities and inequalities. The variable μ can be considered as parameters perturbing the solution x. For example, bounding the zeros of a system of polynomials whose coefficients depend on parameters is a special case of this problem. Our goal is to find minimum ellipsoid bounds just for x. Using theorems from real algebraic geometry, the ellipsoid bound can be found by solving a particular polynomial optimization problem with sums of squares (SOS) techniques. Some numerical examples are also given.     

对话李克正教授：为什么学习代数几何

以与首都师范大学的李克正教授对话的方式,通过其口简要介绍代数几何这门重要学科在我国的早期发展情况,详细回忆李克正教授在国外学习代数几何的过程,以及他回国后的教学与研究成果,并通俗地阐述代数几何方法对于解决重大数论问题所起的关键作用．     

Minimal invariant varieties and first integrals for algebraic foliations

Let X be an irreducible algebraic variety over ℂ, endowed with an algebraic foliation . In this paper, we introduce the notion of minimal invariant variety V( , Y) with respect to ( , Y), where Y is a subvariety of X. If Y = {x} is a smooth point where the foliation is regular, its minimal invariant variety is simply the Zariski closure of the leaf passing through x. First we prove that for very generic x, the varieties V( , x) have the same dimension p. Second we generalize a result due to X. Gomez- Mont (see [G-M]). More precisely, we prove the existence of a dominant rational map F : X → Z, where Z has dimension (n − p), such that for very generic x, the Zariski closure of F⁻¹(F(x)) is one and only one minimal invariant variety of a point. We end up with an example illustrating both results.     

实分片代数曲线的某些研究

分片代数曲线作为二元样条函数的零点集合是经典代数曲线的推广. 利用代数的基本知识, 本文对实分片代数曲线的基本性质进行了初步讨论, 并且将实分片代数曲线与相应的二元样条分类进行讨论. 最后, 对实分片代数曲线上的孤立点进行了研究.     

代数系数幂级数在超越数上值的代数无关性

本文证明了一类具有代数系数的幂级数在超越数上值约代数无关性．     

弱代数性自反与强代数性自反

Algebraic reflexivity introduced by Hadwin is related to linear interpolation. In this paper, the concepts of weakly algebraic reflexivity and strongly algebraic reflexivity which are also related to linear interpolation are introduced. Some properties of them are obtained and some relations between them revealed.     

Terminal 3-fold Divisorial Contractions of a Surface to a Curve I

Let X be a smooth curve on a 3-fold which has only index 1 terminal singularities along . In this paper we investigate the existence of extremal terminal divisorial contractions E Y X, contracting an irreducible surface E to . We consider cases with respect to the singularities of the general hypersurface section S of X through . We completely classify the cases when S is A _i , i 3, and D _2n for any n.     

关于一类函数的代数逼近度的注记

设A（z)是函数列{fn(z)}的极限函数，已知^[4],当|fn(z)-A(z)|在z=0的阶满足一定的条件时，A（z)是超越函数。本文给出了极限函数的代数逼近度函数。     

代数几何码概述

本文概述了有限域代数曲线上的码的一些最近结果．     

Affine Algebraic Varieties Relative to an Algebraic Theory

Affine algebraic varieties relative to an algebraic theory are introduced and described as irreducible components of affine algebraic sets. Their category is shown to be dually equivalent to the category of irreducible functional algebras.     

Algebraic interface‐based coarsening AMG preconditioner for multi‐scale sparse matrices with applications to radiation hydrodynamics computation

Coarsening is a crucial component of algebraic multigrid (AMG) methods for iteratively solving sparse linear systems arising from scientific and engineering applications. Its application largely determines the complexity of the AMG iteration operator. Usually, high operator complexities lead to fast convergence of the AMG method; however, they require additional memory and as such do not scale as well in parallel computation. In contrast, although low operator complexities improve parallel scalability, they often lead to deterioration in convergence. This study introduces a new type of coarsening strategy called algebraic interface‐based coarsening that yields a better balance between convergence and complexity for a class of multi‐scale sparse matrices. Numerical results for various model‐type problems and a radiation hydrodynamics practical application are provided to show the effectiveness of the proposed AMG solver.