对流占优扩散问题的经济型流线扩散有限元法

In this paper, the economical finite difference-streamline diffusion (EFDSD) schemes based on the linear F.E. space for time-dependent linear and non-linear convection-dominated diffusion problems are constructed. The stability and error estimation with quasi-optimal order approximation are established in the norm stronger than L^2 - norm for the schemes considered. It is indicated by the results obtained that,for linear F.E. space, the EFDSD schemes have the same specific properties of stability and convergence as the traditional FDSD schemes for the problems discussed.     

Filled functions for unconstrained global optimization

The paper is concerned with the filled functions for global optimization of a continuous function of several variables. More general forms of filled functions are presented for smooth and nonsmooth optimizations. These functions have either two adjustable parameters or one adjustable parameter. Conditions on functions and on the values of parameters are given so that the constructed functions are desired filled functions.     

NON C^0 NONCONFORMING ELEMENTS FOR ELLIPTIC FOURTH ORDER SINGULAR PERTURBATION PROBLEM

In this paper we give a convergence theorem for non C^0 nonconforming finite element to solve the elliptic fourth order singular perturbation problem. Two such kind of elements, a nine parameter triangular element and a twelve parameter rectangular element both with double set parameters, are presented. The convergence and numerical results of the two elements are given.     

The Order Properties of r-compact Operators on Banach Lattices

We present here that F（E,F）, the space of all r-compact operators from E into F, is a generalised sublattice of L^r（E, F） for arbitary Banach lattices E and F, and that the characterization of the regular norm on F（E, F） is order continuous. Some conditions for F（E, F） to be a KB-space or a band in .L（E, F） are also provided.     

三参数Weibull分布参数和其它可靠性指标的区间估计方法

This paper discusses the interval estimations method for the parameters and other reliability characters of a three-poxameter Weibull distribution. According to the fiducial distrlbution theory of the parameter, the author presents the confidence intervals of the porameters, the reliability and the reliable life. An example mad simulation results are given. It is shown that the method presented in this paper is practicable and worth noticing.     

ON INTERSECTIONS OF INDEPENDENT NONDEGENERATE DIFFUSION PROCESSES

Let X(1)= {X(1)(s), s ∈ R+ } and X(2)= {X(2)(t), t ∈ R+ } be two independent nondegenerate diusion processes with values in Rd. The existence and fractal dimension of intersections of the sample paths of X(1)and X(2)are studied. More generally, let E1, E2 ■(0, ∞) and F  Rd be Borel sets. A necessary condition and a suffcient condition for P{X(1)(E1) ∩ X(2)(E2) ∩ F = φ} 0 are proved in terms of the Bessel-Riesz type capacity and Hausdor measure of E1 ×E2 ×F in the metric space(R+ ×R+ ×Rd, ρ), where ρ is an unsymmetric metric defined in R+ × R+ × Rd. Under reasonable conditions, results resembling those of Browian motion are obtained.     

Exact traveling wave solutions and bifurcations in a nonlinear elastic rod equation

The exact parametric representations of the traveling wave solutions for a nonlinear elastic rod equation are considered. By using the method of planar dynamical systems, in different parameter regions, the phase portraits of the corresponding traveling wave system are given. Exact explicit kink wave solutions, periodic wave solutions and some unbounded wave solutions are obtained.     

Central limit theorem of linear regression model under right censorship

In this paper,the estimation of joint dlstribution F(y,z)of(Y,Z)and the estimation in thelinear regression model Y=b'Z+εfor complete data are extended to that of the right censored data.Theregression parameter estimates of b and the variance of ε are weighted least square estimates with randomweights. The central limit theorems of the estimators are obtained under very weak conditions and the derivedasymptotic variance has a very simple form.     

解对流扩散方程的子域精细积分AGEI方法

Based on subdomain precise integration method, a class of two-levelimplicit schemes containing parameter a＞0 for the initial-boundary value prob-lem of convection-diffusion equation are presented. Their local truncation errorsare O(a△t+△t2+△x2). The implicit schemes are unconditionally stable for all a＞0. Then on the basis of the implicit schemes, an alternating group explicit iter-ative (AGEI) method is proposed, and convergence of the iterative process isproved. Because the whole calculation process is explicit, so the AGEI method isvery suitable to parallel arithmetic. Numerical example shows that the AGEImethod has high accuracy and good practicability.     

Multi-parameter Tikhonov Regularization—An Augmented Approach

We study multi-parameter regularization （multiple penalties） for solving linear inverse problems to promote simultaneously distinct features of the sought-for objects. We revisit a balancing principle for choosing regularization parameters from the viewpoint of augmented Tikhonov regularization, and derive a new parameter choice strategy called the balanced discrepancy principle. A priori and a posteriori error estimates are provided to theoretically justify the principles, and numerical algorithms for efficiently implementing the principles are also provided. Numerical results on deblurring are presented to illustrate the feasibility of the balanced discrepancy principle.     

Representations of tensor product l.m.c.*-algebras

If E is a l.m.c.*-algebra with a b.a.i., (E), (E) denote the enveloping algebra and the space of representations of E respectively, while (E) stands for the non-zero extreme points of the continuous positive linear forms on E. Thus, for suitable l.m.c.*-algebras E, F and an admissible topology on E F, (E F) is given by the completed-tensor product of (E), (F) (where is the projective tensorial l.m.c.C*-topology), while (E F) by the cartesian product of (E), (F). An analogous decomposition of (E F) is not valid in general.This paper is partly based on the author's Ph.D. Thesis (Univ. of Athens)     

Borel reducibility as an additive property of domains

We prove that under certain requirements, if E and F are Borel equivalence relations, , is a countable union of Borel sets, and E ↾ X _n , is Borel reducible to F for all n, then E ↾ X is Borel reducible to F. Thus the property of Borel reducibility to F is countably additive as a property of domains. Bibliography: 19 titles. Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 358, 2008, pp. 189–198.     

On some vector lattices of operators and their finite elements

If the vector space of all regular operators between the vector lattices E and F is ordered by the collection of its positive operators, then the Dedekind completeness of F is a sufficient condition for to be a vector lattice. and some of its subspaces might be vector lattices also in a more general situation. In the paper we deal with ordered vector spaces of linear operators and ask under which conditions are they vector lattices, lattice-subspaces of the ordered vector space or, in the case that is a vector lattice, sublattices or even Banach lattices when equipped with the regular norm. The answer is affirmative for many classes of operators such as compact, weakly compact, regular AM-compact, regular Dunford-Pettis operators and others if acting between appropriate Banach lattices. Then it is possible to study the finite elements in such vector lattices , where F is not necessary Dedekind complete. In the last part of the paper there will be considered the question how the order structures of E, F and are mutually related. It is also shown that those rank one and finite rank operators, which are constructed by means of finite elements from E′ and F, are finite elements in . The paper contains also some generalization of results obtained for the case in [10].      

Private vs. Public

Abstract

Foundations and Higher Education: Grant Making from Golden Years through Steady State by Earl F. Cheit and Theodore E. Lobman, New York: Carnegie Council on Policy Studies in Higher Education, 1979, 141 pages.     

Petersson Products of Singular and Almost Singular Theta Series

We evaluate Petersson products of pairs of Siegel theta series of degree n attached to even lattices of rank mn. This allows us to get nice expressions, involving Dirichlet series and standard L-functions, for Petersson products of Siegel modular forms that are linear combinations of such theta series. Some applications to the theory of theta-liftings are also discussed.Mathematics Subject Classification (2000): 11E45, 11E10, 11F27, 11F46     

Numerical solution of minimax problems of optimal control,part 1

This paper contains general transformation techniques useful to convert minimax problems of optimal control into the Mayer-Bolza problem of the calculus of variations [Problem (P)]. We consider two types of minimax problems: minimax problems of Type (Q), in which the minimax function depends on the state and does not depend on the control; and minimax problems of Type (R), in which the minimax function depends on both the state and the control. Both Problem (Q) and Problem (R) can be reduced to Problem (P).For Problem (Q), we exploit the analogy with a bounded-state problem in combination with a transformation of the Jacobson type. This requires the proper augmentation of the state vectorx(t), the control vectoru(t), and the parameter vector , as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized.For Problem (R), we exploit the analogy with a bounded-control problem in combination with a transformation of the Valentine type. This requires the proper augmentation of the control vectoru(t) and the parameter vector , as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized.In a subsequent paper (Part 2), the transformation techniques presented here are employed in conjunction with the sequential gradient-restoration algorithm for solving optimal control problems on a digital computer; both the single-subarc approach and the multiple-subarc approach are discussed.This research was supported by the National Science Foundation, Grant No. ENG-79-18667, and by Wright-Patterson Air Force Base, Contract No. F33615-80-C3000. This paper is a condensation of the investigations reported in Refs. 1–7. The authors are indebted to E. M. Coker and E. M. Sims for analytical and computational assistance.     

Analytical description of strong extremum in a convex set

Let E, F be normed linear partially ordered spaces and E ⁺,F ⁺ the cones of positive elements in E and F. The mapping G: E F is given and X=G ¹ (F ⁺ ). Necessary and sufficient conditions are derived for x ₀ X to be a strong minimum (the least element). The conditions are applied to establish the existence of optimal correction in an improper linear programming problem.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 65, pp. 107–112, 1988.     

Non-causal models in long term planning via set contractive optimal control methods

The notion of consistency for optimal plans introduced in [F.E. Kydland, E.C. Prescott, Rules rather than decisions: The inconsistency of optimal plans, J. Polit. Econ. 85 (3) (1977) 473–491] is studied in relation to dynamic programming and to multi-objective optimal control. It is demonstrated that the consistency condition for an optimal sequence of n policies for periods from 1 to n corresponding to a sequence of n economic agents’ decisions that together constitute an optimal plan for an agreed-upon social objective function is equivalent to a multi-objective problem with n+1 criteria. An optimal plan is consistent if and only if the corresponding (n+1)-criteria problem is balanced, and consistent optimal plans do exist in such economic situations. Otherwise, the consistency requirement generates the balance set and a set of Pareto solutions, and both can be computed as illustrated in the inflation–unemployment example extended for two periods with three objectives to optimize. The procedure of “consistent planning for the infinite horizon” considered in [F.E. Kydland, E.C. Prescott, Rules rather than decisions: The inconsistency of optimal plans, J. Polit. Econ. 85 (3) (1977) 473–491] is shown to concur with Bellman’s principle of optimality that may be invalid in many practical cases including the case considered in [F.E. Kydland, E.C. Prescott, Rules rather than decisions: The inconsistency of optimal plans, J. Polit. Econ. 85 (3) (1977) 473–491]. Finitely causal and non-causal models are introduced for long term planning in a multi-objective (Pareto) framework, and it is demonstrated how to deal with non-causal models using new set-contractive methods for multi-objective global optimization. The results are illustrated by examples.     

PROJECTIONS ON OPERATOR DUALS

Abstract

We discuss the existence of a projection with kernel K_b(E,F) ¹ (the annihilator of the quasi-compact operators) on the dual space of the space L _b,(E, F) of continous linear operators. Our results are proved in the context of Hausdorff locally convex spaces, but also provide extensions of recent results in the context of Banach spaces.     

Ki-covers. II. Ki-perfect graphs

AK_i is a complete subgraph of size i. A K_i-cover of a graph G(V, E) is a set C of K_i?1s of G such that every K_i in G contains at least one K_i?1 in C . c_i(G) is the cardinality of a smallest K_i-cover of G. A K_i-packing of G is a set of K_is such that no two K_is have i ? 1 nodes in common. p_i(G) is the cardinality of a largest K_i-packing of G. Let F _i(G) denote the set of K_is in G and define c_i(F) and p_i(F) analogously for F ? F _i(G). G is K_i-perfect if ?F ? F _i(G), c_i(F) = p_i(F). The K₂-perfect graphs are precisely the bipartite graphs. We present a characterization of K_i-perfect graphs that is similar to the Strong Perfect Graph Conjecture, and explore the relationships between K_i-perfect graphs and normal hypergraphs. Furthermore, if iA denotes the 0 ? 1 matrix of G where the rows are the elements of F _i?1(G) that belong to at least one K_i and the columns are the elements of F _i(G), then we show that iA is perfect iff G is a K_i-perfect graph. We also characterize the K_i-perfect graphs for which iAis balanced.