No description available.

Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, December 1990. / Thesis Advisor(s): Tummala, Murali. Second Reader: Therrien, Charles W. "December 1990." Description based on title screen as viewed on April 1, 2010. DTIC Identifier(s): Iterations, Parametric Analysis, Algorithms, Estimates, Theses, Computerized Simulation, Convergence. Author(s) subject terms: Finite Impulse Response, Infinite Impulse Response, Matrix Splitting, Matrix Portioning, Toeplitz, Symmetric, Condition Number. Includes bibliographical references (p. 90). Also available in print.

Thesis (Ph. D.)--University of Wisconsin--Madison, 1962. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 73-75).

In this paper an attempt will be made to answer the question: what is uniform convergence? The guiding principle in the presentation of material is to make it understandable to senior and graduate mathematics students , thus enabling it to be used as either a syllabus of as reference material for a course covering this subject. It is supposed that the student will have an understanding of continuity, uniform continuity, convergence, and boundedness before reading this paper. Examples will be used throughout the paper to help the reader obtain a better understanding of the topics provided. / Typescript. / "A Paper." / "Submitted to the Graduate Council of Florida State University in partial fulfillment of the requirements for the degree of Master of Science." / "August, 1957." / Advisor: McArthur, Charles W., Professor Directing Paper. / Includes bibliographical references (leaf 38).

The optimal model reduction problem, whether formulated in the H² or H^∞ norm frameworks, is an inherently nonconvex problem and thus provides a nontrivial computational challenge. This study systematically examines the requirements of probability-one homotopy methods to guarantee global convergence. Homotopy algorithms for nonlinear systems of equations construct a continuous family of systems, and solve the given system by tracking the continuous curve of solutions to the family. The main emphasis is on guaranteeing transversality for several homotopy maps based upon the pseudogramian formulation of the optimal projection equations and variations based upon canonical forms. These results are essential to the probability-one homotopy approach by guaranteeing good numerical properties in the computational implementation of the homotopy algorithms. / Ph. D.

Schema mappings have been extensively studied in the context of data exchange and data integration, where they have turned out to be the right level of abstraction for formalizing data interoperability tasks. Up to now and for the most part, schema mappings have been studied as static objects, in the sense that each time the focus has been on a single schema mapping of interest or, in the case of composition, on a pair of schema mappings of interest. In this paper, we adopt a dynamic viewpoint and embark on a study of sequences of schema mappings and of the limiting behavior of such sequences. To this effect, we first introduce a natural notion of distance on sets of finite target instances that expresses how "Close" two sets of target instances are as regards the certain answers of conjunctive queries on these sets. Using this notion of distance, we investigate pointwise limits and uniform limits of sequences of schema mappings, as well as the companion notions of pointwise Cauchy and uniformly Cauchy sequences of schema mappings. We obtain a number of results about the limits of sequences of GAV schema mappings and the limits of sequences of LAV schema mappings that reveal striking differences between these two classes of schema mappings. We also consider the completion of the metric space of sets of target instances and obtain concrete representations of limits of sequences of schema mappings in terms of generalized schema mappings, that is, schema mappings with infinite target instances as solutions to (finite) source instances.

Recently, there has been a broad discussion regarding the timing of joining the Euro zone. The mainstream opinion is that the sooner the Czech Republic joins, the better. However, as this thesis indicates, especially the econometric model, the Czech Republic is not ready for doing so. Hence, an early accession may not be beneficial.

We study the order convergence of sequences on a vector lattice. It is shown that this mode of convergence is induced by a convergence structure. One such a convergence structure is defined and its properties are studied. We apply the results obtained to find the completion of C(X). We also obtain a Banach-Steinhauss theorem for ó-order continuous operators. / Dissertation (Magister Scientiae)--University of Pretoria, 2007. / Mathematics and Applied Mathematics / unrestricted

ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, Nevada / This paper discusses how IRIG 106 Chapter 10 recording techniques could be employed in a network-centric environment, while maintaining as many of the strengths of the traditional approach. In the course of that discussion, aspects of the published standard which would have to be disregarded or reinterpreted for a network-centric approach to be adopted are illustrated.

The purpose of this paper is to study convergence of certain continued fractions.