minimum fill in inapproximability and almost tight lower bounds abstract given an n n sparse symmetric matrix with m nonzero entries performing gaussian elimination may turn some zeroes into nonzero values so called fill ins the minimum fill in problem asks whether it is possible to perform the elimination with at most k fill ins we exclude the existence of polynomial time approximation schemes for this problem assuming p np and the existence of 2 o n 1 time approximation schemes for any positive assuming the exponential time hypothesis we also give a 2 o k 1 2 n o 1 parameterized lower bound all these results come as corollaries of a new reduction from vertex cover to the minimum fill in problem which might be of its own interest all previous reductions for similar problems start from some kind of graph layout problems and hence have limited use in understanding their fine grained complexity

bilum block versions of multielimination and multilevel ilu preconditioner for general sparse linear systems we introduce block versions of the multielimination incomplete lu ilum factorization preconditioning technique for solving general sparse unstructured linear systems these preconditioners have a multilevel structure and for certain types of problems may exhibit properties that are typically enjoyed by multigrid methods several heuristic strategies for forming blocks of independent sets are introduced and their relative merits are discussed the advantages of block ilum over point ilum include increased robustness and efficiency we compare several versions of the block ilum point ilum and the dual threshold based ilut preconditioners in particular tests with some convection diffusion problems show that it may be possible to obtain convergence that is nearly independent of the reynolds number as well as of the grid size

the covariance matrix of the potts model a random cluster analysis we consider the covariance matrix g mm q2 of thed dimensionalq states potts model rewriting it in the random cluster representation of fortuin and kasteleyn in any of theq ordered phases we identify the eigenvalues of this matrix both in terms of representations of the unbroken symmetry group of the model and in terms of random cluster connectivities and covariances thereby attributing algebraic significance to these stochastic geometric quantities we also show that the correlation length corresponding to the decay rate of one of the eigenvalues is the same as the inverse decay rate of the diameter of finite clusers for dimensiond 2 we show that this correlation length and the correlation length of the two point function with free boundary conditions at the corresponding dual temperature are equal up to a factor of two for systems with first order transitions this relation helps to resolve certain inconsistencies between recent exact and numerical work on correlation lengths at the self dual point o for systems with second order transitions this relation implies the equality of the correlation length exponents from above and below threshold as well as an amplitude ratio of two in the course of proving the above results we establish several properties of independent interest including left continuity of the inverse correlation length with free boundary conditions and upper semicontinuity of the decay rate for finite clusters in all dimensions and left continuity of the two dimensional free boundary condition percolation probability at o we also introduce dlr equations for the random cluster model and use them to establish ergodicity of the free measure in order to prove these results we introduce a new class of events which we call decoupling events and two inequalities for these events the first is similar to the fkg inequality but holds for events which are neither increasing nor decreasing the second is similar to the van den berg kesten inequality in standard percolation both inequalities hold for an arbitrary fkg measure

the toda hierarchy and the kdv hierarchy this paper considers the relation between the periodic kdv hierarchy and the limit of the periodic toda hierarchies by choosing the initial data of the toda flows in a canonical way the behavior of a certain toda flow can mimic kdv flows conjecturally a method of deforming the kdv hierarchy is given

constrained kp hierarchy and bi hamiltonian structures the kakomtsev petviashvili kp hierarchy is considered together with the evolutions of eigenfunctions and adjoint eigenfunctions constraining the kp flows in terms of squared eigenfunctions one obtains 1 1 dimensional integrable equations with scattering problems given by pseudo differential lax operators the bi hamiltonian nature of these systems is shown by a systematic construction of two general poisson brackets on the algebra of associated lax operators gauge transformations provide miura links to modified equations these systems are constrained flows of the modified kp hierarchy for which again a general description of their bi hamiltonian nature is given the gauge transformations are shown to be poisson maps relating the bi hamiltonian structures of the constrained kp hierarchy and the modified kp hierarchy the simplest realization of this scheme yields the akns hierarchy and its miura link to the kaup broer hierarchy

poisson lie group of pseudodifferential symbols we introduce a lie bialgebra structure on the central extension of the lie algebra of differential operators with scalar or matrix coefficients on the line and on the circle this defines a poisson lie structure on the dual group of pseudodifferential symbols of an arbitrary real or complex order we show that the usual second benney gl n kdv or gl n adler gelfand dickey and kp poisson structures are naturally realized as restrictions of this poisson structure to submanifolds of this universal poisson lie group moreover the reduced sl n versions of these manifolds orw n algebras in physical terminology can be viewed as certain subspaces of the quotient of this poisson lie group by the dressing action of the group of functions on the circle or as a result of a poisson reduction finally we define an infinite set of commuting functions on the poisson lie group that give the standard families of hamiltonians when restricted to the submanifolds mentioned above the poisson structure and hamiltonians on the whole group interpolate between the poisson structures and hamiltonians of benney kp and kdv flows we also discuss the geometrical meaning ofw as a limit of poisson algebraswe as e 0

long time tails in the parabolic anderson model with bounded potential we consider the parabolic anderson problem t u u u on 0 z d with random i i d potential z z zd and the initial condition u 0 1 our main assumption is that esssup 0 0 depending on the thickness of the distribution prob 0 close to its essential supremum we identify both the asymptotics of the moments of u t 0 and the almost sure asymptotics of u t 0 as t in terms of variational problems as a by product we establish lifshitz tails for the random schrodinger operator at the bottom of its spectrum in our class of distributions the lifshitz exponent ranges from d 2 to the power law is typically accompanied by lower order corrections

on the use of inexact subdomain solvers for bddc algorithms the standard bddc balancing domain decomposition by constraints preconditioner is shown to be equivalent to a preconditioner built from a partially subassembled finite element model this results in a system of linear algebraic equations which is much easier to solve in parallel than the fully assembled model the cost is then often dominated by that of the problems on the subdomains an important role is also played both in theory and practice by an averaging operator and in addition exact dirichlet solvers are used on the subdomains in order to eliminate the residual in the interior of the subdomains the use of inexact solvers for these problems and even the replacement of the dirichlet solvers by a trivial extension are considered it is established that one of the resulting algorithms has the same eigenvalues as the standard bddc algorithm and the connection of another with the feti dp algorithm with a lumped preconditioner is also considered multigrid methods are used in the experimental work and under certain assumptions it is established that the iteration count essentially remains the same as when exact solvers are used while considerable gains in the speed of the algorithm can be realized since the cost of the exact solvers grows superlinearly with the size of the subdomain problems while the multigrid methods are linear

the incomplete factorization multigraph algorithm we present a new family of multigraph algorithms ilu mg based upon an incomplete sparse matrix factorization using a particular ordering and allowing a limited amount of fill in while much of the motivation for multigraph comes from multigrid ideas ilu mg is distinctly different from algebraic multilevel methods the graph of the sparse matrix a is recursively coarsened by eliminating vertices using a graph model similar to gaussian elimination incomplete factorizations are obtained by allowing only the fill in generated by the vertex parents associated with each vertex multigraph is numerically compared with algebraic multigrid on some examples arising from discretizations of partial differential equations on unstructured grids

gibbs states of graphical representations of the potts model with external fields we consider the ferromagnetic q state potts model with each of the q spin values coupled to an external field we also introduce a generalized random cluster model which includes both the potts model in arbitrary homogeneous external fields and the noninteger q random cluster model as special cases we establish the fkg property the finite energy condition uniqueness of the infinite cluster and gibbsianness of limit states for this generalized model furthermore we develop the theory of gibbs states for the edwards sokal representation of the potts model in a field and relate the phase structure in this representation to those in the spin and random cluster representations finally we characterize the possible color s of the infinite cluster s and show that the correspondence between edwards sokal gibbs states and their random cluster marginals is bijective once the color of the infinite cluster is fixed

a hybrid algorithm for reducing matrix bandwidth a hybrid algorithm for reducing the bandwidth of symmetric matrices is described in terms of a finite element grid the new algorithm produces significantly lower bandwidths than either the commonly used gibbs poole stockmeyer gps or cuthill mckee cm algorithms with run times comparable to the original cm algorithm the new hybrid algorithm uses the gps algorithm as a preprocessor to provide a good initial node numbering for the author s node shuffling algorithm which accounts for variable degrees of freedom per node dof node the hybrid algorithm was tested on the 30 benchmark problems that were compiled by everstine and on 10 supplemental problems with variable dof node bandwidths and cpu times are presented for all problems

how good is recursive bisection the most commonly used p way partitioning method is recursive bisection rb it first divides a graph or a mesh into two equal sized pieces by a good bisection algorithm and then recursively divides the two pieces ideally we would like to use an optimal bisection algorithm because the optimal bisection problem that partitions a graph into two equal sized subgraphs to minimize the number of edges cut is np complete practical rb algorithms use more efficient heuristics in place of an optimal bisection algorithm most such heuristics are designed to find the best possible bisection within allowed time we show that the rb method even when an optimal bisection algorithm is assumed may produce a p way partition that is very far way from the optimal one our negative result is complemented by two positive ones first we show that for some important classes of graphs that occur in practical applications such as well shaped finite element and finite difference meshes rb is within a constant factor of the optimal one almost always second we show that if the balance condition is relaxed so that each block in the p way partition is bounded by 2n p where n is the number of vertices of the graph then a modified rb finds an approximately balanced p way partition whose cost is within an o log p factor of the cost of the optimal p way partition

log determinant relaxation for approximate inference in discrete markov random fields graphical models are well suited to capture the complex and non gaussian statistical dependencies that arise in many real world signals a fundamental problem common to any signal processing application of a graphical model is that of computing approximate marginal probabilities over subsets of nodes this paper proposes a novel method applicable to discrete valued markov random fields mrfs on arbitrary graphs for approximately solving this marginalization problem the foundation of our method is a reformulation of the marginalization problem as the solution of a low dimensional convex optimization problem over the marginal polytope exactly solving this problem for general graphs is intractable for binary markov random fields we describe how to relax it by using a gaussian bound on the discrete entropy and a semidefinite outer bound on the marginal polytope this combination leads to a log determinant maximization problem that can be solved efficiently by interior point methods thereby providing approximations to the exact marginals we show how a slightly weakened log determinant relaxation can be solved even more efficiently by a dual reformulation when applied to denoising problems in a coupled mixture of gaussian model defined on a binary mrf with cycles we find that the performance of this log determinant relaxation is comparable or superior to the widely used sum product algorithm over a range of experimental conditions

uniqueness of the infinite component in a random graph with applications to percolation and spin glasses we extend the theorem of burton and keane on uniqueness of the infinite component in dependent percolation to cover random graphs on d or d with long range edges we also study a short range percolation model related to nearest neighbor spin glasses on d or on a slab d 0 k and prove both that percolation occurs and that the infinite component is unique forv 2 0 1 or larger

the extended bigraded toda hierarchy we generalize the toda lattice hierarchy by considering n m dependent variables we construct roots and logarithms of the lax operator which are uniquely defined operators with coefficients that are series of differential polynomials in the dependent variables and we use them to provide a lax pair definition of the extended bigraded toda hierarchy generalizing 4 using r matrix theory we give the bi hamiltonian formulation of this hierarchy and we prove the existence of a tau function for its solutions finally we study the dispersionless limit and its connection with a class of frobenius manifolds on the orbit space of the extended affine weyl groups of the a series defined by dubrovin and zhang 1998 compos math 111 167

slab percolation and phase transitions for the ising model we prove using the random cluster model a strict inequality between site percolation and magnetization in the region of phase transition for the d dimensional ising model thus improving a result of 5 we extend this result also at the case of two plane lattices mathbb z slabs and give a characterization of phase transition in this case the general case of n slabs with n an arbitrary positive integer is partially solved and it is used to show that this characterization holds in the case of three slabs with periodic boundary conditions

r matrices and higher poisson brackets for integrable systems the tri hamiltonian nature of lax equations is revealed starting with an r matrix on an associative algebra g equipped with a trace form there are g compatible poisson brackets with linear quadratic and cubic dependence on the coordinates the invariant functions casimir functions on g are in involution relative to these brackets they yield a hierarchy of integrable tri hamiltonian lax equations the results can be applied to solvable pde s such as the korteweg de vries equation as well as to finite integrable systems such as the toda lattice in these cases the poisson structures considered here turn out to be abstract versions of the first 3 hamiltonian operators of these equations obtained by their well known recursion operators

agreement percolation and phase coexistence in some gibbs systems we extend some relations between percolation and the dependence of gibbs states on boundary conditions known for ising ferromagnets to other systems and investigate their general validity percolation is defined in terms of the agreement of a configuration with one of the ground states of the system this extension is studied via examples and counterexamples including the antiferromagnetic ising and hard core models on bipartite lattices potts models and many layered ising and continuum widom rowlinson models in particular our results on the hard square lattice model make rigorous observations made by hu and mak on the basis of computer simulations moreover we observe that the naturally defined clusters of the widom rowlinson model play for the wr model itself the same role that the clusters of the fortuin kasteleyn measure play for the ferromagnetic potts models the phase transition and percolation in this system can be mapped into the corresponding liquid vapor transition of a one component fluid

on the uniqueness of the infinite occupied cluster in dependent two dimensional site percolation we consider dependent site percolation on the two dimensional square lattice the underlying probability measure being invariant and ergodic under each of the translations and invariant under axis reflections if this measure satisfies the fkg condition and if percolation occurs then we show that the infinite occupied cluster is unique with probability 1 and that all vacant star clusters are finite

implicit multigrid algorithms for incompressible turbulent flows on unstructured grids an implicit code for computing inviscid and viscous incompressible flows on unstructured grids is described the foundation of the code is a backward euler time discretization for which the linear system is approximately solved at each time step with either a point implicit method or a preconditioned generalized minimal residual gmres technique for the gmres calculations several techniques are investigated for forming the matrix vector product convergence acceleration is achieved through a multigrid scheme that uses nonnested coarse grids that are generated using a technique described in the present paper convergence characteristics are investigated and results are compared with an exact solution for the inviscid flow over a four element airfoil viscous results which are compared with experimental data include the turbulent flow over a naca 4412 airfoil a three element airfoil for which mach number effects are investigated and three dimensional flow over a wing with a partial span flap

decomposed block cholesky factorization in the karmarkar algorithm solving a class of super large lp problems abstract with the introduction of the karmarkar algorithm hope for optimally solving super large lp problems often encountered in the communication industry had risen high however a general code of the original karmarkar algorithm takes a long computation time to solve such problems employing proper factorization schemes substantially reduces the computation time of the karmarkar algorithm for solving super large linear programming lp problems in this paper a modified version of the karmarkar algorithm is described and the complexities involved in applying the algorithm to a class of super large lp problems are identified a factorization scheme decomposed block cholesky factorization is proposed in order to reduce the complexities of a matrix inversion operation that occurs within every iteration of the karmarkar algorithm the factorization scheme capitalizes on the generally well behaved block structure of the constraint matrix of the super large lp problems the computation time required for solving a class of super large lp problems using this scheme is estimated to be reduced by a factor of two orders of magnitude the proposed factorization scheme is even more promising in solving the super large lp problems on parallel processors using the karmarkar algorithm

finite element network approximation of conductivity in particle composites a new finite element method computes conductivity in some unstructured particle reinforced composite material the 2 phase material under consideration is composed of a poorly conducting matrix material filled by highly conducting circular inclusions which are randomly dispersed the mathematical model is a poisson type problem with discontinuous coefficients the discontinuities are huge in contrast and quantity the proposed method generalizes classical continuous piecewise affine finite elements to special computational meshes which encode the particles in a network structure important geometric parameters such as the volume fraction are preserved exactly the computational complexity of the method is almost proportional to the number of inclusions this is minimal in the sense that the representation of the underlying geometry via the positions and radii of the inclusions is of the same complexity the discretization error is proportional to the distance of neighboring inclusions and independent of the conductivity contrast in the medium

why finite element discretizations can be factored by triangular hierarchical matrices although the asymptotic complexity of direct methods for the solution of large sparse finite element systems arising from second order elliptic partial differential operators is far from being optimal these methods are often preferred over modern iterative methods this is mainly due to their robustness in this article it is shown that an approximate lu decomposition exists which can be computed in the algebra of hierarchical matrices with almost linear complexity and with the same robustness as the classical lu decomposition low precision approximations may be used for preconditioning iterative solvers as a byproduct we prove that schur complements of stiffness matrices can be approximated with almost linear complexity

random cluster representation of the blume capel model the so called diluted random cluster model may be viewed as a random cluster representation of the blume capel model it has three parameters a vertex parameter a an edge parameter p and a cluster weighting factor q stochastic comparisons of measures are developed for the vertex marginal when q 1 2 and the edge marginal when q 1 taken in conjunction with arguments used earlier for the random cluster model these permit a rigorous study of part of the phase diagram of the blume capel model

the logarithm of the derivative operator and higher spin algebras of w type we use the notion of the logarithm of the derivative operator to describew type algebras as central extensions of the algebra of differential operators we also provide closed formulae for the truncations ofw1 to higher spin algebras withs m for allm 2 the results are extended to matrix valued differential operators introducing a logarithmic generalization of the maurer cartan cocycle

the q deformation of akns d hierarchy in this paper we have considered the q deformation of the akns d hierarchy proved the bilinear identity and obtained the function of the q deformed akns d hierarchy

lower eigenvalue bounds for singular pencils of matrices abstract beauwens procedure for obtaining lower eigenvalue bounds for regular pencils of matrices a b is simplified and extended to the singular case the theory is then compared through a particular perturbed modified incomplete factorization with notay s generalization of another approach initiated by gustafsson and developed by axelsson and barker and by wilmet

mathematics of dispersive water waves a commuting hierarchy of dispersive water wave equations makes a three hamiltonian system which belongs to a general class of nonstandard integrable systems whose theory is developed the modified water wave hierarchy is a bi hamiltonian system its modification bifurcates the water wave hierarchy and the hierarchies of the korteweg de vries and the modified korteweg de vries equations as well as the classical miura map are given new representations through various specializations of nonstandard systems

on the unicity of discontinuous transitions in the two dimensional potts and ashkin teller models we investigate the uniqueness of the discontinuous phase transition of the q state potts model and the symmetric q s s cubic model generalized ashkin teller model on the integer square lattice with q 1 for the ferromagnetic cases when there is a discontinuous phase transition we show that the discontinuity can only occur at a point of self duality

geometric aspects of quantum spin states a number of interesting features of the ground states of quantum spin chains are analyzed with the help of a functional integral representation of the system s equilibrium states methods of general applicability are introduced in the context of the su 2s 1 invariant quantum spin s chains with the interaction p o wherep o is the projection onto the singlet state of a pair of nearest neighbor spins the phenomena discussed here include the absence of neel order the possibility of dimerization conditions for the existence of a spectral gap and a dichotomy analogous to one found by affleck and lieb stating that the systems exhibit either slow decay of correlations or translation symmetry breaking our representation elucidates the relation evidence for which was found earlier of the p o spin s systems with the potts and the fortuin kasteleyn random cluster models in one more dimension the method reveals the geometric aspects of the listed phenomena and gives a precise sense to a picture of the ground state in which the spins are grouped into random clusters of zero total spin e g within such structure the dichotomy is implied by a topological argument and the alternatives correspond to whether or not the clusters are of finite mean length

local and non local multiplicative poisson vertex algebras and differential difference equations we develop the notions of multiplicative lie conformal and poisson vertex algebras local and non local and their connections to the theory of integrable differential difference hamiltonian equations we establish relations of these notions to q deformed w algebras and lattice poisson algebras we introduce the notion of adler type pseudodifference operators and apply them to integrability of differential difference hamiltonian equations

on the uniqueness of the infinite cluster in the percolation model we simplify the recent proof by aizenman kesten and newman of the uniqueness of the infinite open cluster in the percolation model our new proof is more suitable for generalization in the direction of percolation type processes with dependent site variables

density and uniqueness in percolation two results on site percolation on thed dimensional lattice d 1 arbitrary are presented in the first theorem we show that for stationary underlying probability measures each infinite cluster has a well defined density with probability one the second theorem states that if in addition the probability measure satisfies the finite energy condition of newman and schulman then there can be at most one infinite cluster with probability one the simple arguments extend to a broad class of finite dimensional models including bond percolation and regular lattices

nonlinear poisson structures and r matrices we introduce quadratic poisson structures on lie groups associated with a class of solutions of the modified yang baxter equation and apply them to the hamiltonian description of lax systems the formal analog of these brackets on associative algebras provides second structures for certain integrable equations in particular the integrals of the toda flow on generic orbits are shown to satisfy recursion relations finally we exhibit a third order poisson bracket for which ther matrix approach is feasible

seismic waveform inversion in the frequency domain part 1 theory and verification in a physical scale model seismic waveforms contain much information that is ignored under standard processing schemes seismic waveform inversion seeks to use the full information content of the recorded wavefield in this paper i present apply and evaluate a frequency space domain approach to waveform inversion the method is a local descent algorithm that proceeds from a starting model to refine the model in order to reduce the waveform misfit between observed and model data the model data are computed using a full wave equation viscoacoustic frequency domain finite difference method ray asymptotics are avoided and higher order effects such as diffractions and multiple scattering are accounted for automatically the theory of frequency domain waveform wavefield inversion can be expressed compactly using a matrix formalism that uses finite difference finite element frequency domain modeling equations expressions for fast local descent inversion using back propagation techniques then follow naturally implementation of

a particular bit of universality scaling limits of some dependent percolation models we study families of dependent site percolation models on the triangular lattice and hexagonal lattice that arise by applying certain cellular automata to independent percolation configurations we analyze the scaling limit of such models and show that the distance between macroscopic portions of cluster boundaries of any two percolation models within one of our families goes to zero almost surely in the scaling limit it follows that each of these cellular automaton generated dependent percolation models has the same scaling limit in the sense of aizenman burchard 3 as independent site percolation on

phase transition and uniqueness of levelset percolation the main purpose of this paper is to introduce and establish basic results of a natural extension of the classical boolean percolation model also known as the gilbert disc model we replace the balls of that model by a positive non increasing attenuation function l 0 0 to create the random field y x l x y where is a homogeneous poisson process in rd the field is then a random potential field with infinite range dependencies whenever the support of the function l is unbounded in particular we study the level sets h y containing the points y rd such that y h in the case where l has unbounded support we give for any d 2 a necessary and sufficient condition on l for h y to have a percolative phase transition as a function of h we also prove that when l is continuous then so is almost surely moreover in this case and for d 2 we prove uniqueness of the infinite component of h when such exists and we also show that the so called percolation function is continuous below the critical value hc

the algebra of q pseudodifferential symbols and the q wkp n algebra in this paper we continue with the program to explore the topography of the space of w type algebras in the present case the starting point is the work of khesin lyubashenko and roger on the algebra of q deformed pseudodifferential symbols and their associated integrable hierarchies the analysis goes on by studying the associated hamiltonian structures for which compact expressions are found the fundamental poisson brackets yield q deformations of wkp and related w type algebras which in specific cases coincide with the ones constructed by frenkel and reshetikhin the construction underlies a continuous correspondence between the hamiltonian structures of the toda lattice and the kp hierarchies

multiply rooted multiscale models for large scale estimation divide and conquer or multiscale techniques have become popular for solving large statistical estimation problems the methods rely on defining a state which conditionally decorrelates the large problem into multiple subproblems each more straightforward than the original however this step cannot be carried out for asymptotically large problems since the dimension of the state grows without bound leading to problems of computational complexity and numerical stability in this paper we propose a new approach to hierarchical estimation in which the conditional decorrelation of arbitrarily large regions is avoided and the problem is instead addressed piece by piece the approach possesses promising attributes it is not a local method the estimate at every point is based on all measurements it is numerically stable for problems of arbitrary size and the approach retains the benefits of the multiscale framework on which it is based a broad class of statistical models a stochastic realization theory an algorithm to calculate statistical likelihoods and the ability to fuse local and nonlocal measurements

lu decomposition and numerical structure for solving large sparse nonsymmetric linear systems abstract in this work the solution of a large sparse linear system of equations with an arbitrary sparsity pattern is obtained by using lu decomposition method as well as numerical structure approach the lu decomposition method is based on doolittle s method while the numerical structure approach is based on cramer s rule the numerical structure approach produces direct solution without facing fill in problems as encountered in lu decomposition in order to reduce the fill ins in the decomposition the powers of a boolean matrix obtained from the coefficient matrix a are taken so that the fill ins in the structure of a can be known in advance the position of fill ins in a are thus determined in the best choice manner that is it is very effective and memory wise cheap we also outline a method by using numerical structure with reduced computation efforts finally experiments are performed on eight examples to compare the efficiency of the proposed methods the results obtained are reported in a table it is found that the lu decomposition method is much better than numerical structure the usefulness of numerical structure approach is also discussed

calculation of incompressible viscous flows by an unconditionally stable projection fem this paper investigates the numerical performance of a finite element implementation of a new incremental fractional step method to compute steady and unsteady incompressible viscous flows under general boundary conditions and using unstructured meshes a variational framework is adopted which accommodates two different spaces for representing and approximating the velocity fields calculated respectively in the viscous and inviscid phases of the method but which leads to a very simple numerical scheme in terms of only one discrete velocity field an unconditionally stable semi implicit approximation of the nonlinear term is used to eliminate any time step restriction as far as the numerical stability is concerned numerical results for five test problems in two dimensions are reported to illustrate the flexibility of the proposed method

the asymmetric random cluster model and comparison of ising and potts models we introduce the asymmetric random cluster or arc model which is a graphical representation of the potts lattice gas and establish its basic properties the arc model allows a rich variety of comparisons in the fkg sense between models with different parameter values we give for example values h for which the 0 s configuration in the potts lattice gas is dominated by the configuration of the h ising model the potts model with possibly an external field applied to one of the spins is a special case of the potts lattice gas which allows our comparisons to yield rigorous bounds on the critical temperatures of potts models for example we obtain 0 571 1 exp c 0 600 for the 9 state potts model on the hexagonal lattice another comparison bounds the movement of the critical line when a small potts interaction is added to a lattice gas which otherwise has only interparticle attraction arc models can also be compared to related models such as the partial fk model obtained by deleting a fraction of the nonsingleton clusters from a realization of the fortuin kasteleyn random cluster model this comparison leads to bounds on the effects of small annealed site dilution on the critical temperature of the potts model

algorithm for random close packing of spheres with periodic boundary conditions the isotropic algorithm is constructed for random close packing of equisized spheres with triply periodic boundary conditions all previously published packing methods with periodic boundaries were kinetics determined i e they contained a densification rate as an arbitrary parameter in contrast the present algorithm is kinetic independent and demonstrates an unambiguous convergence to the experimental results to suppress crystallization the main principles of our algorithm are 1 to form a contact network at an early stage and 2 retain contacts throughout the densification as far as possible the particles are allowed to swell by the numerical solution of the differential equations of densification the rhs of these equations is calculated efficiently from a linear system by a combination of conjugate gradient iterations and exact sparse matrix technology when an excessive contact occurs and one of the existing bonds should be broken to continue the densification an efficient criterion based on multidimensional simplex geometry is used for searching the separating bond the algorithm has a well defined termination point resulting in a perfect contact network with the average coordination number six for particle number n 1 and a system of normal reactions between the spheres maintaining the structure these forces are the counterpart of the algorithm and can be used to calculate small elastic particle deformations in a granular medium extensive calculations are presented for 50 n 5 400 and demonstrate very good agreement with the experimental packing density about 0 637 and structure

a preconditioning technique for indefinite systems resulting from mixed approximations of elliptic problems this paper provides a preconditioned iterative technique for the solution of saddle point problems these problems typically arise in the numerical approximation of partial differential equations by lagrange multiplier techniques and or mixed methods the saddle point problem is reformulated as a symmetric positive definite system which is then solved by conjugate gradient iteration applications to the equations of elasticity and stokes are discussed and the results of numerical experiments are given

the q deformed mkp hierarchy with self consistent sources wronskian solutions and solitons based on the eigenfunction symmetry constraint of the q deformed modified kp hierarchy a q deformed mkp hierarchy with self consistent sources q mkphscss is constructed the q mkphscss contain two types of q deformed mkp equation with self consistent sources by the combination of the dressing method and the method of variation of constants a generalized dressing approach is proposed to solve the q deformed kp hierarchy with self consistent sources q kphscss using the gauge transformation between the q kphscss and the q mkphscss the q deformed wronskian solutions for the q kphscss and the q mkphscss are obtained the one soliton solutions for the q deformed kp mkp equation with a source are given explicitly

random cluster models on the triangular lattice we study percolation and the random cluster model on the triangular lattice with 3 body interactions starting with percolation we generalize the star triangle transformation we introduce a new parameter the 3 body term and identify configurations on the triangles solely by their connectivity in this new setup necessary and sufficient conditions are found for positive correlations and this is used to establish regions of percolation and non percolation next we apply this set of ideas to the q 1 random cluster model we derive duality relations for the suitable random cluster measures prove necessary and sufficient conditions for them to have positive correlations and finally prove some rigorous theorems concerning phase transitions

a parallel multithreaded sparse triangular linear system solver abstract we propose a parallel sparse triangular linear system solver based on the spike algorithm sparse triangular systems are required to be solved in many applications often they are a bottleneck due to their inherently sequential nature furthermore typically many successive systems with the same coefficient matrix and with different right hand side vectors are required to be solved the proposed solver decouples the problem at the cost of extra arithmetic operations as in the banded case compared to the banded case there are extra savings due to the sparsity of the triangular coefficient matrix we show the parallel performance of the proposed solver against the state of the art parallel sparse triangular solver in intel s math kernel library mkl on a multicore architecture we also show the effect of various sparse matrix reordering schemes numerical results show that the proposed solver outperforms mkl s solver in 80 of cases by a factor of 2 47 on average

non coexistence of infinite clusters in two dimensional dependent site percolation this paper presents three results on dependent site percolation on the square lattice first there exists no positively associated probability measure on 0 1 mathbb z 2 with the following properties a a single infinite 0cluster exists almost surely b at most one infinite 1 cluster exists almost surely c certain probabilities regarding 1 clusters are bounded away from zero second the coexistence of an infinite 1 cluster and an infinite 0cluster has probability zero when the underlying probability measure is ergodic with respect to translations positively associated and satisfies the finite energy condition the third result analyzes the typical structure of infinite clusters of both types in the absence of positive association namely under a slightly sharpened finite energy condition the existence of infinitely many disjoint infinite self avoiding 1 paths follows from the existence of an infinite 1 cluster the same holds with respect to 0paths and 0clusters

sparse matrix methods for use in electrical impedance tomography the objective of electrical impedance tomography is to reconstruct images representing the electrical impedance properties within a region from measurements on its surface the region of interest is usually first discretized into finite elements and its impedance distribution updated using an iterative process this iterative process comprises two problems the forward problem and the inverse problem the inverse problem is the term given to the procedure to find the internal impedance distribution from a set of boundary measurements and the forward problem is the determination of the internal voltages given the impedance distribution and boundary conditions in this paper several finite element labelling algorithms implemented by the authors in c are investigated and their impact on the forward problem solver efficiency analysed the algorithms investigated are nested dissection nd minimum degree mdg minimum deficiency mdf and simulated annealing for fill in safr reduction during cholesky factorization these renumbering strategies were applied to a collection of representative two dimensional meshes used in electrical impedance tomography and a number of sparse symmetric matrices from the harwell boeing sparse matrix collection for comparison purposes 1997 by john wiley sons ltd

a one parameter family of hamiltonian structures for the kp hierarchy and a continuous deformation of the nonlinear wkp algebra the kp hierarchy is hamiltonian relative to a one parameter family of poisson structures obtained from a generalized adler map in the space of formal pseudodifferential symbols with noninteger powers the resulting w algebra is a one parameter deformation of wkp admitting a central extension for generic values of the parameter reducing naturally to w n for special values of the parameter and contracting to the centrally extended w1 w and further truncations in the classical limit all algebras in the one parameter family are equivalent and isomorphic towkp the reduction induced by setting the spin one field to zero yields a one parameter deformation of hat w infty which contracts to a new nonlinear algebra of the w type

integrable discrete systems on r and related dispersionless systems a general framework for integrable discrete systems on r in particular containing lattice soliton systems and their q deformed analogs is presented the concept of regular grain structures on r generated by discrete one parameter groups of diffeomorphisms in terms of which one can define algebra of shift operators is introduced two integrable hierarchies of discrete chains together with bi hamiltonian structures and their continuous limits are constructed the inverse problem based on the deformation quantization scheme is considered

the percolation transition for the zero temperature stochastic ising model on the hexagonal lattice on the planar hexagonal lattice mathbb h we analyze the markov process whose state t in 1 1 mathbb h updates each site v asynchronously in continuous time t 0 so that v t agrees with a majority of its three neighbors the initial v 0 s are i i d with p v 0 1 p 0 1 we study both rigorously and by monte carlo simulation the existence and nature of the percolation transition as t and p 1 2 denoting by t p the expected size of the plus cluster containing the origin we 1 prove that 1 2 and 2 study numerically critical exponents associated with the divergence of p as p 1 2 a detailed finite size scaling analysis suggests that the exponents and of this t dependent percolation model have the same values 4 3 and 43 18 as standard two dimensional independent percolation we also present numerical evidence that the rate at which t as t is exponential

effective preconditioning through minimum degree ordering interleaved with incomplete factorization in this paper we study a kind of effective preconditioning technique which interleaves the incomplete cholesky ic factorization with an approximate minimum degree ordering an ic factorization algorithm derived from ikj version gaussian elimination is proposed and some details on implementation are presented then we discuss the ways to compute the degrees of the unnumbered nodes exactly and approximately using the concept of element absorbing when used in conjunction with conjugate gradient algorithm the new preconditioners usually lead to fast convergence the numerical experiments show that the interleaving of symbolic ordering and numerical ic factorization will generate better preconditioners than those generated by the ic factorization without ordering or with purely symbolic ordering ahead of the factorization

approximate zero one laws and sharpness of the percolation transition in a class of models including two dimensional ising percolation one of the most well known classical results for site percolation on the square lattice is the equation p c p c 1 in words this equation means that for all values p c of the parameter p the following holds either a s there is an infinite open cluster or a s there is an infinite closed star cluster this result is closely related to the percolation transition being sharp below p c the size of the open cluster of a given vertex is not only a s finite but has a distribution with an exponential tail the analog of this result has been proven by higuchi in 1993 for two dimensional ising percolation at fixed inverse temperature c with external field h the parameter of the model using sharp threshold results approximate zero one laws and a modification of an rsw like result by bollobas and riordan we show that these results hold for a large class of percolation models where the vertex values can be nicely represented in a sense which will be defined precisely by i i d random variables we point out that the ordinary percolation model obviously belongs to this class and we also show that the ising model mentioned above belongs to it