A method of convergence acceleration of some continued fractions

A new method of convergence acceleration is proposed for continued fractions , where and are polynomials in (, ) for sufficiently large. It uses the fact that the modified approximant approaches the continued fraction value, if is sufficiently close to the th tail . Presented method is of iterative character; in each step, by means of an approximation , it produces a new better approximation of the th tail . Formula for is very simple and contains only arithmetical operations. Hence described algorithm is fully rational.     

An algorithm for matching point sets using the l_1 norm

The problem is considered of matching two sets of points in , by translation and rotation. There are many applications, for example in geodesy, computer vision and in the assessment of manufactured parts. When the matching criterion is least squares, there is a well known solution process based on the singular value decomposition of an matrix. Here we consider the use of the norm, which may be more appropriate than least squares in the context of wild points in the data. An algorithm is developed, and is illustrated by some examples for the case .     

An iterative method for the least squares symmetric solution of matrix equation AXB = C

This paper an iterative method is presented to solve the minimum Frobenius norm residual problem: with unknown symmetric matrix . By the iterative method, for any initial symmetric matrix , a solution can be obtained within finite iteration steps in the absence of roundoff errors, and the solution with least Frobenius norm can be obtained by choosing a special kind of initial symmetric matrix. In addition, in the solution set of the minimum Frobenius norm residual problem, the unique optimal approximation solution to a given matrix in Frobenius norm can be expressed as , where is the least norm symmetric solution of the new minimum residual problem: with . Given numerical examples are show that the iterative method is quite efficient.Research supported by Scientific Research Fund of Hunan Provincial Education Department of China (05C797), by China Postdoctoral Science Foundation (2004035645) and by National Natural Science Foundation of China (10571047).     

Using cross-product matrices to compute the SVD

This paper concerns accurate computation of the singular value decomposition (SVD) of an matrix . As is well known, cross-product matrix based SVD algorithms compute large singular values accurately but generally deliver poor small singular values. A new novel cross-product matrix based SVD method is proposed: (a) Use a backward stable algorithm to compute the eigenpairs of and take the square roots of the large eigenvalues of it as the large singular values of ; (b) form the Rayleigh quotient of with respect to the matrix consisting of the computed eigenvectors associated with the computed small eigenvalues of ; (c) compute the eigenvalues of the Rayleigh quotient and take the square roots of them as the small singular values of . A detailed quantitative error analysis is conducted on the method. It is proved that if small singular values are well separated from the large ones then the method can compute the small ones accurately up to the order of the unit roundoff . An algorithm is developed that is not only cheaper than the standard Golub–Reinsch and Chan SVD algorithms but also can update or downdate a new SVD by adding or deleting a row and compute certain refined Ritz vectors for large matrix eigenproblems at very low cost. Several variants of the algorithm are proposed that compute some or all parts of the SVD. Typical numerical examples confirm the high accuracy of our algorithm.Supported in part by the National Science Foundation of China (No. 10471074).     

A representation of bivariate extreme value distributions via norms on \mathbb{R}^{2}

It is known that a bivariate extreme value distribution (EVD) with reverse exponential margins can be represented as , , where is a suitable norm on . We prove in this paper the converse implication, i.e., given an arbitrary norm on , , , defines an EVD with reverse exponential margins, if and only if the norm satisfies for the condition . This result is extended to bivariate EVDs with arbitrary margins as well as to extreme value copulas. By identifying an EVD , , with the unit ball corresponding to the generating norm , we obtain a characterization of the class of EVDs in terms of compact and convex subsets of .     

Efficient spectral-Galerkin algorithms for direct solution for second-order differential equations using Jacobi polynomials

It is well known that spectral methods (tau, Galerkin, collocation) have a condition number of ( is the number of retained modes of polynomial approximations). This paper presents some efficient spectral algorithms, which have a condition number of , based on the Jacobi–Galerkin methods of second-order elliptic equations in one and two space variables. The key to the efficiency of these algorithms is to construct appropriate base functions, which lead to systems with specially structured matrices that can be efficiently inverted. The complexities of the algorithms are a small multiple of operations for a -dimensional domain with unknowns, while the convergence rates of the algorithms are exponentials with smooth solutions.     

Sharp Weighted Young's Inequalities and Moser–Trudinger Inequalities on Heisenberg Type Groups and Grushin Spaces

We obtain sharp weighted Moser–Trudinger inequalities for first-layer symmetric functions on groups of Heisenberg type, and for -symmetric functions on the Grushin plane. To this end, we establish weighted Young's inequalities in the form , for first-layer radial weights on a general Carnot group and functions with first-layer symmetric. The proofs use some sharp estimates for hypergeometric functions.Research supported by NSF grant DMS-0228807.     

Self-dual codes over \mathbb{Z}_8 and \mathbb{Z}_9

We study self-dual codes over the rings and . We define various weights and weight enumerators over these rings and describe the groups of invariants for each weight enumerator over the rings. We examine the torsion codes over these rings to describe the structure of self-dual codes. Finally we classify self-dual codes of small lengths over .     

Hermite polynomials on the plane

The space of bivariate generalised Hermite polynomials of degree n is invariant under rotations. We exploit this symmetry to construct an orthonormal basis for which consists of the rotations of a single polynomial through the angles , ℓ=0,...n. Thus we obtain an orthogonal expansion which retains as much of the symmetry of as is possible. Indeed we show that a continuous version of this orthogonal expansion exists.      

Every Finite Topology is Generated by a Partial Pseudometric

Given any preorder on a finite set , we present an algorithm to construct a partial pseudometric on which generates in the sense that if and only if . The specialization topology generated by agrees with the topology generated by the partial pseudometric -balls, and consequently any topology on is generated by a partial pseudometric.     

Koszul and Gorenstein Properties for Homogeneous Algebras

The Koszul property was generalized to homogeneous algebras of degree in [5], and related to -complexes. We show that if the -homogeneous algebra is generalized Koszul, AS-Gorenstein and of finite global dimension, then one can apply the Van den Bergh duality theorem to i.e., there is a Poincaré duality between Hochschild homology and cohomology of as for .     

On Auslander–Reiten Components and Heller Lattices for Integral Group Rings

Let be a finite group, a complete discrete valuation ring of characteristic zero with residue class field of characteristic , and a block of the group ring . Suppose that is of infinite representation type and is sufficiently large to satisfy certain conditions. Let be the Auslander–Reiten quiver of and a connected component of . In this paper, we show that if contains some Heller lattices then the tree class of the stable part of is . Also, we show that has infinitely many components of type if a defect group of is neither cyclic nor a Klein four group.Presented by Jon Carlson.     

Point Counting in Families of Hyperelliptic Curves

Let E _Γ be a family of hyperelliptic curves defined by , where is defined over a small finite field of odd characteristic. Then with in an extension degree n field over this small field, we present a deterministic algorithm for computing the zeta function of the curve by using Dwork deformation in rigid cohomology. The time complexity of the algorithm is and it needs bits of memory. A slight adaptation requires only space, but costs time . An implementation of this last result turns out to be quite efficient for n big enough. H. Hubrechts is a Research Assistant of the Research Foundation–Flanders (FWO–Vlaanderen).     

Dy namic of Abelia n Subgroups of GL( n, $$\mathbb{C}$$): A Structure Theorem

In this paper, we characterize the dynamic of every Abelian subgroups of , or . We show that there exists a -invariant, dense open set U in saturated by minimal orbits with a union of at most n -invariant vector subspaces of of dimension n−1 or n−2 over . As a consequence, has height at most n and in particular it admits a minimal set in . This work is supported by the research unit: systèmes dynamiques et combinatoire: 99UR15-15     

Regularity in Capacity and the Dirichlet Laplacian

Given an open set in , we prove that every function in is zero everywhere on the boundary if and only if is regular in capacity. If in addition is bounded, then it is regular in capacity if and only if the mapping from into is injective, where denotes the Perron solution of the Dirichlet problem. Let be the set of all open subsets of which are regular in capacity. Then one can define metrics and on only involving the resolvent of the Dirichlet Laplacian. Convergence in those metrics will be defined to be the local/global uniform convergence of the resolvent of the Dirichlet Laplacian applied to the constant function . We prove that the spaces and are complete and contain the set of all open sets which are regular in the sense of Wiener (or Dirichlet regular) as a closed subset.     

Intrinsic Ultracontractivity for Schrödinger Operators with Mixed Boundary Conditions

Let be a domain in , . Let be a divergence form uniformly elliptic operator with Dirichlet boundary conditions on and Neumann boundary conditions on , where is a closed subset of . We prove intrinsic ultracontractivity for the semigroup associated to the Schrödinger operator , where is a potential in the Kato class, provided that is locally Lipschitz and is given by the boundary of either a Hölder domain of order or a uniformly Hölder domain of order , . Our results extend to the mixed boundary case the results of Bañuelos, Bass and Burdzy, Bass and Hsu, and Davies and Simon.     

Parabolic Raynaud bundles

Let X be an irreducible smooth projective curve defined over the field of complex numbers, a finite set of closed points and N ≥ 2 a fixed integer. For any pair , there exists a parabolic vector bundle on X, with parabolic structure over S and all parabolic weights in , that has the following property: Take any parabolic vector bundle of rank r on X whose parabolic points are contained in S, all the parabolic weights are in and the parabolic degree is d. Then is parabolically semistable if and only if there is no nonzero parabolic homomorphism from to .     

A hierarchically consistent,iterative sequence transformation

Recently, the author proposed a new nonlinear sequence transformation, the iterative transformation, which was shown to provide excellent results in several applications (Homeier [15]). In the present contribution, this sequence transformation is derived by a hierarchically consistent iteration of some basic transformation. Hierarchical consistency is proposed as an approach to control the well-known problem that the basic transformation can be generalized in many ways. Properties of the transformation are studied. It is of similar generality as the well-knownE algorithm (Brezinski [3], Håvie [18]). It is shown that the transformation can be implemented quite easily. In addition to the defining representation, there are alternative algorithms for its computation based on generalized differences. The kernel of the transformation is derived. The expression for the kernel is relatively compact and does not depend on any lower-order transforms. It is shown that several important other sequence transformations can be computed in an economical way using the transformation.Communicated by C. Brezinski     

Uniform Estimates of the Fundamental Solution for a Family of Hypoelliptic Operators

In this paper we are concerned with a family of elliptic operators represented as sum of square vector fields: , in where is the Laplace operator, , and the limit operator is hypoelliptic. It is well known that admits a fundamental solution . Here we establish some a priori estimates uniform in of it, using a modification of the lifting technique of Rothschild and Stein. As a consequence we deduce some a priori estimates uniform in , for solutions of the approximated equation . These estimates can be used in particular while studying regularity of viscosity solutions of nonlinear equations represented in terms of vector fields.     

On applicability of the sparse grid method in the worst case setting

Let be bounded linear operators. We provide several sufficient conditions for the validity of the inequality . These results can be applied to error and cost estimates for the sparse grid method.