Correlation functions of the XXZ Heisenberg chain for Δ = 1/2

We present exact results for the correlation functions of the XXZ Heisenberg chain in the thermodynamic limit for the anisotropy parameter Δ = 1/2. We show that the results are given by integers. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 150, No. 2, pp. 304–310, February, 2007.     

Newton's method on the complex exponential function

We show that when Newton's method is applied to the product of a polynomial and the exponential function in the complex plane, the basins of attraction of roots have finite area.

     

A structural characterization of real k-potent matrices

Some well-known characterizations of nonnegative k-potent matrices have been obtained by Flor [P. Flor, On groups of nonnegative matrices, Compositio Math. 21 (1969), pp. 376–382.] and Jeter and Pye [M. Jeter and W. Pye, Nonnegative (s,?t)-potent matrices, Linear Algebra Appl. 45 (1982), pp. 109–121.]. In this article, we obtain a structural characterization of a real k-potent matrix A, provided that (sgn(A)) ^k+1 is unambiguously defined, regardless of whether A is nonnegative or not.     

阶梯矩阵及其一般化在迭代法中的应用

Lu Hao首先给出了阶梯矩阵及其一般性的定义和性质．这类矩阵为迭代法提供了新矩阵分裂的基础．基于此新矩阵类的迭代方法的显著特征是它对于并行计算很容易被实现．应用这一新的分解方法,给出了一般的加速松弛方法（GAOR）,而关于AOR方法的一些性质可以被延伸到该新方法中,并针对Hermite正定矩阵进行了新方法收敛性的分析．最后,给出了一些例子来表明新方法的优越性．     

Solution methods for the generalized integral volterra equation of the first kind

This paper is devoted to exact and approximate methods (first of all, direct ones) for the solution of integro-operational equations. Themost attention is paid to the theoretical substantiation of the collocation method for the solution of the mentioned equations within the general theory of approximate methods developed by L. V. Kantorovich.     

Calculation of the branch points of the eigenfunctions corresponding to wave spheroidal functions

A method for calculating eigenvalues λ_mn(c) corresponding to the wave spheroidal functions in the case of a complex parameter c is proposed, and a comprehensive numerical analysis is performed. It is shown that some points c _s are the branch points of the functions λ_mn(c) with different indexes n ₁ and n ₂ so that the value λ_{mn 1} (c _s ) is a double one: λ_{mn 1} (c _s ) = λ_{mn 2} (c _s ). The numerical analysis suggests that, for each fixed m, all the branches of the eigenvalues λ_mn(c) corresponding to the even spheroidal functions form a complete analytic function of the complex argument c. Similarly, all the branches of the eigenvalues λ_mn(c) corresponding to the odd spheroidal functions form a complete analytic function of c. To perform highly accurate calculations of the branch points c _s of the double eigenvalues λ_mn(c _s), the Padé approximants, the Hermite-Padé quadratic approximants, and the generalized Newton iterative method are used. A large number of branch points are calculated.     

On finding robust approximate inverses for large sparse matrices

This paper presents a method based on matrix-matrix multiplication concepts for determining the approximate (sparse) inverses of sparse matrices. The suggested method is a development on the well-known Schulz iteration and it can successfully be combined with iterative solvers and sparse approximation techniques as well. A detailed discussion on the convergence rate of this scheme is furnished. Results of numerical experiments are also reported to illustrate the performance of the proposed method.     

A robust AINV‐type method for constructing sparse approximate inverse preconditioners in factored form

This paper suggests a new method, called AINV‐A, for constructing sparse approximate inverse preconditioners for positive‐definite matrices, which can be regarded as a modification of the AINV method proposed by Benzi and Túma. Numerical results on SPD test matrices coming from different applications demonstrate the robustness of the AINV‐A method and its superiority to the original AINV approach. Copyright © 2001 John Wiley & Sons, Ltd.     

Spectra of infinite-dimensional sample covariance matrices

We study spectral functions of infinite-dimensional random Gram matrices of the form RR^T, where R is a rectangular matrix with an infinite number of rows and with the number of columns N → ∞, and the spectral functions of infinite sample covariance matrices calculated for samples of volume N → ∞ under conditions analogous to the Kolmogorov asymptotic conditions. We assume that the traces d of the expectations of these matrices increase with the number N such that the ratio d/N tends to a constant. We find the limiting nonlinear equations relating the spectral functions of random and nonrandom matrices and establish the asymptotic expression for the resolvent of random matrices. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 148, No. 2, pp. 309–322, August, 2006.     

Approximate Inverse Preconditioners for Some Large Dense Random Electrostatic Interaction Matrices

A sparse mesh-neighbour based approximate inverse preconditioner is proposed for a type of dense matrices whose entries come from the evaluation of a slowly decaying free space Green’s function at randomly placed points in a unit cell. By approximating distant potential fields originating at closely spaced sources in a certain way, the preconditioner is given properties similar to, or better than, those of a standard least squares approximate inverse preconditioner while its setup cost is only that of a diagonal block approximate inverse preconditioner. Numerical experiments on iterative solutions of linear systems with up to four million unknowns illustrate how the new preconditioner drastically outperforms standard approximate inverse preconditioners of otherwise similar construction, and especially so when the preconditioners are very sparse. AMS subject classification (2000) 65F10, 65R20, 65F35, 78A30     

U-Turn Alternating Sign Matrices,Symplectic Shifted Tableaux and their Weighted Enumeration

Alternating sign matrices with a U-turn boundary (UASMs) are a recent generalization of ordinary alternating sign matrices. Here we show that variations of these matrices are in bijective correspondence with certain symplectic shifted tableaux that were recently introduced in the context of a symplectic version of Tokuyama’s deformation of Weyl’s denominator formula. This bijection yields a formula for the weighted enumeration of UASMs. In this connection use is made of the link between UASMs and certain square ice configuration matrices.     

Stabilized rounded addition of hierarchical matrices

The efficiency of hierarchical matrices is based on the approximate evaluation of usual matrix operations. The introduced approximation error may, however, lead to a loss of important matrix properties. In this article we present a technique which preserves the positive definiteness of a matrix independently of the approximation quality. The importance of this technique is illustrated by an elliptic mixed boundary value problem with tiny Dirichlet part. Copyright © 2007 John Wiley & Sons, Ltd.     

Lozi映射的奇怪吸引子和吸引域的结构

本文证明了在［１］中给出的参数区域内，对应的Ｌｏｚｉ映射的奇怪吸引子Λ是横截及弱横截同宿点的闭包，并且Λ上任意两个双曲周期点形成横截及弱横截环；奇怪吸引子的吸引域的闭包就是双曲不动点Ｘ的稳定流形的闭包；进一步，吸引域恰好是ωｓ（Ｘ）及那些边界包含在ωｓ（Ｘ）及ωｕ（Ｘ）中区域的并，从而我们证明了对于Ｌｏｚｉ映射，Ｍ．Ｂｅｎｅｄｉｃｋｓ和Ｌ．Ｃａｒｌｅｓｏｎ等的有关奇怪吸引子的吸引域的结构的猜测．     

Approximate first-order and second-order directional derivatives of a marginal function in convex optimization

Given a convex functionf: ^p × ^q (–, +], the marginal function is defined on ^p by (x)=inf{f(x, y)|y ^q }. Our purpose in this paper is to express the approximate first-order and second-order directional derivatives of atx ₀ in terms of those off at (x ₀,y ₀), wherey ₀ is any element for which (x ₀)=f(x ₀,y ₀).The author is indebted to one referee for pointing out an inaccuracy in an earlier version of Theorem 4.1.     

More refined enumerations of alternating sign matrices

We study a further refinement of the standard refined enumeration of alternating sign matrices (ASMs) according to their first two rows instead of just the first row, and more general “d-refined” enumerations of ASMs according to the first d rows. For the doubly-refined case of d=2, we derive a system of linear equations satisfied by the doubly-refined enumeration numbers A_n,i,j that enumerate such matrices. We give a conjectural explicit formula for A_n,i,j and formulate several other conjectures about the sufficiency of the linear equations to determine the A_n,i,j's and about an extension of the linear equations to the general d-refined enumerations.     

Structural stability on basins for numerical methods

In this paper, we show that a flow with a hyperbolic compact attracting set is structurally stable on the basin of attraction with respect to numerical methods. The result is a generalized version of earlier results by Garay, Li, Pugh, and Shub. The proof relies heavily on the usual invariant manifold theory elaborated by Hirsch, Pugh, and Shub (1977), and by Robinson (1976).

     

Linear relations of refined enumerations of alternating sign matrices

In recent papers we have studied refined enumerations of alternating sign matrices with respect to a fixed set of top and bottom rows. The present paper is a first step towards extending these considerations to alternating sign matrices where in addition some left and right columns are fixed. The main result is a simple linear relation between the number of n×n alternating sign matrices where the top row as well as the left and the right column is fixed and the number of n×n alternating sign matrices where the two top rows and the bottom row are fixed. This may be seen as a first indication for the fact that the refined enumerations of alternating sign matrices with respect to a fixed set of top and bottom rows as well as left and right columns can possibly be reduced to the refined enumerations where only some top and bottom rows are fixed. For the latter numbers we provide a system of linear equations that conjecturally determines them uniquely.     

Domain Decomposition–Finite Difference Approximate Inverse Preconditioned Schemes for Solving Fourth-Order Equations

A new class of explicit approximate inverse preconditioning is introduced for solving fourth-order equations, based on the coupled equation approach, by the domain decomposition method in conjunction with various finite difference approximation schemes. Explicit approximate inverse arrow-type matrix techniques, based on the concept of sparse L U-type factorization procedures, are introduced for computing a class of approximate inverses. Explicit preconditioned conjugate gradient-type schemes are presented for the efficient solution of linear systems. Applications of the method to a biharmonic problem are discussed and numerical results are given.