Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “MATHEMATICAL LOGIC”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 127 records · Page 7

An algorithm for linearizing convex extremal problems

This paper suggests a method of approximating the solution of minimization problems for convex functions of several variables under convex constraints is suggested. The main idea of this approach is the approximation of a convex function by a piecewise linear function, which results in replacing the problem of convex programming by a linear programming problem. To carry out such an approximation, the epigraph of a convex function is approximated by the projection of a polytope of greater dimension. In the first part of the paper, the problem is considered for functions of one variable. In this case, an algorithm for approximating the epigraph of a convex function by a polygon is presented, it is shown that this algorithm is optimal with respect to the number of vertices of the polygon, and exact bounds for this number are obtained. After this, using an induction procedure, the algorithm is generalized to certain classes of functions of several variables. Applying the suggested method, polynomial algorithms for an approximate calculation of the L{sub p}-norm of a matrix and of the minimum of the entropy function on a polytope are obtained. Bibliography: 19 titles.

97 MATHEMATICS AND COMPUTING↗

Multiresolution analysis on zero-dimensional Abelian groups and wavelets bases

For a locally compact zero-dimensional group (G,+{sup .}), we build a multiresolution analysis and put forward an algorithm for constructing orthogonal wavelet bases. A special case is indicated when a wavelet basis is generated from a single function through contractions, translations and exponentiations. Bibliography: 19 titles.

97 MATHEMATICS AND COMPUTING↗

Refining virtual knot invariants by means of parity

In this work two new invariants of virtual links are constructed: the even Alexander polynomial and the even quandle. The general idea behind the construction is to split the classical crossings into two types, the even and the odd ones, and then define different operations at the crossings of different types. On the other hand, the proposed construction is a realization of the same idea using two closely related languages: the language of quandles and the language of Alexander polynomials. Bibliography: 15 titles.

97 MATHEMATICS AND COMPUTING↗

Estimates for the widths of weighted Sobolev classes

Estimates for the Kolmogorov widths in the L{sub q,v}-metric of weighted Sobolev classes as well as for the approximation numbers of the corresponding embedding operators are found. Bibliography: 33 titles.

97 MATHEMATICS AND COMPUTING↗

Classification of hyperbolic singularities of rank zero of integrable Hamiltonian systems

A complete invariant is constructed that is a solution of the problem of semilocal classification of saddle singularities of integrable Hamiltonian systems. Namely, a certain combinatorial object (an f{sub n}-graph) is associated with every nondegenerate saddle singularity of rank zero; as a result, the problem of semilocal classification of saddle singularities of rank zero is reduced to the problem of enumeration of the f{sub n}-graphs. This enables us to describe a simple algorithm for obtaining the lists of saddle singularities of rank zero for a given number of degrees of freedom and a given complexity. Bibliography: 24 titles.

97 MATHEMATICS AND COMPUTING↗

On the local behaviour of the multidimensional {Lambda}-variation

Let two classes ({Lambda}{sup 1},...,{Lambda}{sup m})BV and (M{sup 1},...,M{sup m})BV on an interval {Delta} be given. In the paper, we find necessary and sufficient conditions for the {Lambda}-variation of any function in the M-class, over a neighbourhood of every regular point, to tend to zero as the neighbourhood decreases. Bibliography: 10 titles.

97 MATHEMATICS AND COMPUTING↗

Chebyshev representation for rational functions

An effective representation is obtained for rational functions all of whose critical points, apart from g-1, are simple and their corresponding critical values lie in a four-element set. Such functions are described using hyperelliptic curves of genus g{>=}1. The classical Zolotarev fraction arises in this framework for g=1. Bibliography: 8 titles.

97 MATHEMATICS AND COMPUTING↗

Spectral decomposition of model operators in de Branges spaces

The paper is devoted to studying a class of completely continuous nonselfadjoint operators in de Branges spaces of entire functions. Among other results, a class of unconditional bases of de Branges spaces consisting of values of their reproducing kernels is constructed. The operators that are studied are model operators in the class of completely continuous non-dissipative operators with two-dimensional imaginary parts. Bibliography: 22 titles.

97 MATHEMATICS AND COMPUTING↗

Approximating smooth functions using algebraic-trigonometric polynomials

The problem under consideration is that of approximating classes of smooth functions by algebraic-trigonometric polynomials of the form p{sub n}(t)+{tau}{sub m}(t), where p{sub n}(t) is an algebraic polynomial of degree n and {tau}{sub m}(t)=a{sub 0}+{Sigma}{sub k=1}{sup m}a{sub k} cos k{pi}t + b{sub k} sin k{pi}t is a trigonometric polynomial of order m. The precise order of approximation by such polynomials in the classes W{sup r}{sub {infinity}(}M) and an upper bound for similar approximations in the class W{sup r}{sub p}(M) with 4/3<p<4 are found. The proof of these estimates uses mixed series in Legendre polynomials which the author has introduced and investigated previously. Bibliography: 13 titles.

97 MATHEMATICS AND COMPUTING↗

Decomposability problem on branched coverings

Given a branched covering of degree d between closed surfaces, it determines a collection of partitions of d, the branch data. In this work we show that any branch data are realized by an indecomposable primitive branched covering on a connected closed surface N with {chi}(N){<=}0. This shows that decomposable and indecomposable realizations may coexist. Moreover, we characterize the branch data of a decomposable primitive branched covering. Bibliography: 20 titles.

97 MATHEMATICS AND COMPUTING↗

Quantitative estimates in Beurling-Helson type theorems

We consider the spaces A{sub p}(T) of functions f on the circle T such that the sequence of Fourier coefficients f-hat={l_brace}f-hat(k), k element of Z{r_brace} belongs to l{sup p}, 1{<=}p<2. The norm in A{sub p}(T) is defined by ||f||{sub A{sub p}}=||f-hat||{sub l}{sup P}. We study the rate of growth of the norms ||e{sup i{lambda}{phi}|}|{sub A{sub p}} as |{lambda}|{yields}{infinity}, {lambda} element of R, for C{sup 1}-smooth real functions {phi} on T. The results have natural applications to the problem of changes of variable in the spaces A{sub p}(T). Bibliography: 17 titles.

97 MATHEMATICS AND COMPUTING↗

Ideals of generalized matrix rings

Let R and S be rings, and {sub R}M{sub S} and {sub S}N{sub R} bimodules. In the paper, in terms of isomorphisms of lattices, relationships between the lattices of one-sided and two-sided ideals of the generalized matrix ring and the corresponding lattices of ideals of the rings R and S are described. Necessary and sufficient conditions for a pair of ideals I, J of rings R and S, respectively, to be the main diagonal of some ideal of the ring K are also obtained. Bibliography: 8 titles.

97 MATHEMATICS AND COMPUTING↗

Triviality of vector bundles on twisted ind-Grassmannians

Twisted ind-Grassmannians are ind-varieties G obtained as direct limits of Grassmannians G(i{sub m},V{sup n}{sub m}) for m element of Z{sub >0} under embeddings of degree greater than 1. It has been conjectured by Donin and Penkov (2003) that any vector bundle of finite rank on a twisted ind-Grassmannian is trivial. We prove this conjecture. Bibliography: 16 titles.

97 MATHEMATICS AND COMPUTING↗

Invariant functions for the Lyapunov exponents of random matrices

A new approach to the study of Lyapunov exponents of random matrices is presented. We prove that any family of nonnegative (dxd)-matrices has a continuous concave invariant functional on R{sup d}{sub +}. Under some standard assumptions on the matrices, this functional is strictly positive, and the coefficient corresponding to it is equal to the largest Lyapunov exponent. As a corollary we obtain asymptotics for the expected value of the logarithm of norms of matrix products and of their spectral radii. Another corollary gives new upper and lower bounds for the Lyapunov exponent, and an algorithm for computing it for families of nonnegative matrices. We consider possible extensions of our results to general nonnegative matrix families and present several applications and examples. Bibliography: 29 titles.

97 MATHEMATICS AND COMPUTING↗