Tikhonov regularization for large-scale linear ill-posed problems is commonly implemented by determining a partial Lanczos bidiagonalization of the matrix of the given system of equations. This paper explores the possibility of instead computing a partial Arnoldi decomposition of the given matrix. Computed examples illustrate that this approach may require fewer matrix–vector product evaluations and, therefore, less arithmetic work. Moreover, the proposed range-restricted Arnoldi–Tikhonov regularization method does not require the adjoint matrix and, hence, is convenient to use for problems for which the adjoint is difficult to evaluate. 相似文献
This note investigates two long-standing conjectures on the Krull dimension of integer-valued polynomial rings and of polynomial rings in the context of (locally) essential domains.
We prove that every JB* triple with rank one bicircular projection is a direct sum of two ideals, one of which is isometrically isomorphic to a Hilbert space.
Many interesting and complicated patterns in the applied sciences are formed through transient pattern formation processes. In this paper we concentrate on the phenomenon of spinodal decomposition in metal alloys as described by the Cahn-Hilliard equation. This model depends on a small parameter, and one is generally interested in establishing sharp lower bounds on the amplitudes of the patterns as the parameter approaches zero. Recent results on spinodal decomposition have produced such lower bounds. Unfortunately, for higher-dimensional base domains these bounds are orders of magnitude smaller than what one would expect from simulations and experiments. The bounds exhibit a dependence on the dimension of the domain, which from a theoretical point of view seemed unavoidable, but which could not be observed in practice.
In this paper we resolve this apparent paradox. By employing probabilistic methods, we can improve the lower bounds for certain domains and remove the dimension dependence. We thereby obtain optimal results which close the gap between analytical methods and numerical observations, and provide more insight into the nature of the decomposition process. We also indicate how our results can be adapted to other situations.
This paper is concerned with tight closure in a commutative Noetherian ring of prime characteristic , and is motivated by an argument of K. E. Smith and I. Swanson that shows that, if the sequence of Frobenius powers of a proper ideal of has linear growth of primary decompositions, then tight closure (of ) `commutes with localization at the powers of a single element'. It is shown in this paper that, provided has a weak test element, linear growth of primary decompositions for other sequences of ideals of that approximate, in a certain sense, the sequence of Frobenius powers of would not only be just as good in this context, but, in the presence of a certain additional finiteness property, would actually imply that tight closure (of ) commutes with localization at an arbitrary multiplicatively closed subset of .
Work of M. Katzman on the localization problem for tight closure raised the question as to whether the union of the associated primes of the tight closures of the Frobenius powers of has only finitely many maximal members. This paper develops, through a careful analysis of the ideal theory of the perfect closure of , strategies for showing that tight closure (of a specified ideal of ) commutes with localization at an arbitrary multiplicatively closed subset of and for showing that the union of the associated primes of the tight closures of the Frobenius powers of is actually a finite set. Several applications of the strategies are presented; in most of them it was already known that tight closure commutes with localization, but the resulting affirmative answers to Katzman's question in the various situations considered are believed to be new.
