Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 6 of 6

Full-Text Articles in Physical Sciences and Mathematics

The Fine Structure Of The Kasparov Groups Ii: Topologizing The Uct, Claude Schochet Oct 2002

The Fine Structure Of The Kasparov Groups Ii: Topologizing The Uct, Claude Schochet

Mathematics Faculty Research Publications

The Kasparov Groups KK∗(A,B) have a natural structure as pseudopolonais groups. In this paper we analyze how this topology interacts with the terms of the Universal Coefficient Theorem (UCT) and the splitting sof the UCT constructed by J. Rosenberg and the author, as well as its canonical three term decomposition which exists under bootstrap hypotheses. We show that the various topologies on [cursive]Ext^{1}_{ℤ}(K∗(A),K∗(B)) and other related groups mostly coincide. Then we focus attention on the Milnor sequence and the fine structure subgroup of KK∗(A,B). …


Stochastic 2-D Navier-Stokes Equation, J. L. Menaldi, S. S. Sritharan Oct 2002

Stochastic 2-D Navier-Stokes Equation, J. L. Menaldi, S. S. Sritharan

Mathematics Faculty Research Publications

In this paper we prove the existence and uniqueness of strong solutions for the stochastic Navier-Stokes equation in bounded and unbounded domains. These solutions are stochastic analogs of the classical Lions-Prodi solutions to the deterministic Navier-Stokes equation. Local monotonicity of the nonlinearity is exploited to obtain the solutions in a given probability space and this signi cantly improves the earlier techniques for obtaining strong solutions, which depended on pathwise solutions to the Navier-Stokes martingale problem where the probability space is also obtained as a part of the solution.


A Posteriori Error Estimates Based On Polynomial Preserving Recovery, Zhimin Zhang, Ahmed Naga Sep 2002

A Posteriori Error Estimates Based On Polynomial Preserving Recovery, Zhimin Zhang, Ahmed Naga

Mathematics Research Reports

Superconvergence of order O(h1+rho), for some rho is greater than 0, is established for gradients recovered using Polynomial Preserving Recovery technique when the mesh is mildly structured. Consequently this technique can be used in building a posteriori error estimator that is asymptotically exact.


Gradient Recovery And A Posteriori Estimate For Bilinear Element On Irregular Quadrilateral Meshes, Zhimin Zhang Aug 2002

Gradient Recovery And A Posteriori Estimate For Bilinear Element On Irregular Quadrilateral Meshes, Zhimin Zhang

Mathematics Research Reports

A polynomial preserving gradient recovery method is proposed and analyzed for bilinear element under general quadrilateral meshes. It has been proven that the recovered gradient converges at a rate O(h1+rho) for rho = min(alpha, 1) when the mesh is distorted O(h1+alpha) (alpha > 0) from a regular one. Consequently, the a posteriori error estimator based on the recovered gradient is asymptotically exact.


Analysis Of Recovery Type A Posteriori Error Estimators For Mildly Structured Grids, Jinchao Xu, Zhimin Zhang Jul 2002

Analysis Of Recovery Type A Posteriori Error Estimators For Mildly Structured Grids, Jinchao Xu, Zhimin Zhang

Mathematics Research Reports

Some recovery type error estimators for linear finite element method are analyzed under O(h1+alpha) (alpha greater than 0) regular grids. Superconvergence is established for recovered gradients by three different methods when solving general non-self-adjoint second-order elliptic equations. As a consequence, a posteriori error estimators based on those recovery methods are asymptotically exact.


A Meshless Gradient Recovery Method Part I: Superconvergence Property, Zhiming Zhang, Ahmed Naga Feb 2002

A Meshless Gradient Recovery Method Part I: Superconvergence Property, Zhiming Zhang, Ahmed Naga

Mathematics Research Reports

A new gradient recovery method is introduced and analyzed. It is proved that the method is superconvergent for translation invariant finite element spaces of any order. The method maintains the simplicity, efficiency, and superconvergence properties of the Zienkiewicz-Zhu patch recovery method. In addition, under uniform triangular meshes, the method is superconvergent for the Chevron pattern, and ultraconvergence at element edge centers for the regular pattern.