An implicit method for linear ill‐posed problems with perturbed operators

An implicit iterative method is applied to solving linear ill‐posed problems with perturbed operators. It is proved that the optimal convergence rate can be obtained after choosing suitable number of iterations. A generalized Morozov's discrepancy principle is proposed for the problems, and then the optimal convergence rate can also be obtained by an a posteriori strategy. The convergence results show that the algorithm is a robust regularization method. Copyright © 2006 John Wiley & Sons, Ltd.     

Mixed Elastico-Plasticity Problems with Partially Unknown Boundaries

In this paper,we study mixed elastico-plasticity problems in which part of the boundary is known,while the other part of the boundary is unknown and is a free boundary.Under certain conditions,this problemcan be transformed into a Riemann-Hilbert boundary value problem for analytic functions and a mixed boundaryvalue problem for complex equations.Using the theory of generalized analytic functions,the solvability of theproblem is discussed.     

Global Parametric Sufficient Optimality Conditions for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized （η,ρ）-invex Functions

In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem.     

Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets

Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation.     

Computational Complexity in Algebraic Systems

Computability and computational complexity were first considered over the fields of real and complex numbers and generalized to arbitrary algebraic systems. This article approaches the theory of computational complexity over an arbitrary algebraic system by taking computability over the list extension for a computational model of it. We study the resultant polynomial complexity classes and mention some NP-complete problems.     

GENERALIZED CIRCLES AND THEIR CONFORMAL MAPPING IN A SUBSPACE OF A WEYL SPACE

The authors give the necessary and sufficient conditions for a generalized circle in a Weyl hypersurface to be generalized circle in the enveloping Weyl space. They then obtain the neccessary and sufficient conditions under which a generalized concircular transformation of one Weyl space onto another induces a generalized transformation oil its subspaces. Finally, it is shown that any totally geodesic or totally umbilical hypersurface of a generalized concircularly flat Weyl space is also generalized concircularly flat.     

一般线性模型下方差最小范数二次无偏估计的稳健性

本文给出了一般线性模型下,由最小二乘得到的方差估计与最小范数二次无偏估计相等的充分必要条件,并且当Gauss-Markov估计与最小二乘估计相等时,可以得到一个简单的等价条件。     

纵横扩张的优化

得到了最小折数纵横扩张的判别准则．针对4-正则图的平面嵌入的纵横扩张的特殊性，给出了它的最小折数纵横扩张判别准则．     

Inner bounds for the spectrum of quasinormal operators

A linear operator in a separable Hilbert space is called a quasinormal one if it is a sum of a normal operator and a compact one. In the paper, bounds for the spectrum of quasinormal operators are established. In addition, the lower estimate for the spectral radius is derived. Under some restrictions, that estimate improves the well-known results. Applications to integral operators and matrices are discussed. Our results are new even in the finite-dimensional case.

     

Large deviation for the empirical eigenvalue density of truncated Haar unitary matrices

Let U_m be an m×m Haar unitary matrix and U_[m,n] be its n×n truncation. In this paper the large deviation is proven for the empirical eigenvalue density of U_[m,n] as m/n→λ and n→∞. The rate function and the limit distribution are given explicitly. U_[m,n] is the random matrix model of quq, where u is a Haar unitary in a finite von Neumann algebra, q is a certain projection and they are free. The limit distribution coincides with the Brown measure of the operator quq.