constructing spectral schemes of the immersed interface method via a global description of discontinuous functions a global description of discontinuous functions is introduced in this paper by expressing a discontinuous function as the sum of a smooth function and a correction term determined by jump conditions we turn the unknown function from a discontinuous one into a sufficiently smooth one when solving a differential equation spectral schemes are developed based on this concept with the intention of eliminating or reducing the gibbs oscillation finite difference schemes are also constructed as an alternative of the current immersed interface methods both spectral and finite difference schemes are tested on one and two dimensional cases

simulating the dynamics of inextensible vesicles by the penalty immersed boundary method in this paper we develop an immersed boundary ib method to simulate the dynamics of inextensible vesicles interacting with an incompressible fluid in order to take into account the inextensibility constraint of the vesicle the penalty immersed boundary pib method is used to virtually decouple the fluid and vesicle dynamics as numerical tests of our current pib method the dynamics of single and multiple inextensible vesicles under shear flows have been extensively explored and compared with the previous literature the method is also validated by a series of convergence study which confirms its consistent first order accuracy on the velocity field the vesicle configuration the vesicle area and the perimeter errors in addition the method is also applied to study a binary component vesicle problem

an immersed boundary method with direct forcing for the simulation of particulate flows we present an improved method for computing incompressible viscous flow around suspended rigid particles using a fixed and uniform computational grid the main idea is to incorporate peskin s regularized delta function approach acta numerica 11 2002 1 into a direct formulation of the fluid solid interaction force in order to allow for a smooth transfer between eulerian and lagrangian representations while at the same time avoiding strong restrictions of the time step this technique was implemented in a finite difference and fractional step context a variety of two and three dimensional simulations are presented ranging from the flow around a single cylinder to the sedimentation of 1000 spherical particles the accuracy and efficiency of the current method are clearly demonstrated

a fast numerical method for solving the three dimensional stokes equations in the presence of suspended particles abstract a new fast numerical method for solving the three dimensional stokes equations in the presence of suspended particles is presented the fluid dynamics equations are solved on a lattice a particle is represented by a set of points each of which moves at the local fluid velocity and is not constrained to lie on the lattice these points are coupled by forces which resist deformation of the particle these forces contribute to the force density in the stokes equations as a result a single set of fluid dynamics equations holds at all points of the domain and there are no internal boundaries particle size shape and deformability may be prescribed computational work increases only linearly with the number of particles so large numbers 500 1000 of particles may be studied efficiently the numerical method involves implicit calculation of the particle forces by minimizing an energy function and solution of a finite difference approximation to the stokes equations using the fourier toeplitz method the numerical method has been implemented to run on all cray computers the implementation exploits the cray s vectorized arithmetic and on machines with insufficient central memory it performs efficient disk 1 o while storing most of the data on disk applications of the method to sedimentation of one two and many particle systems are described trajectories and settling speeds for two particle sedimentation and settling speed for multiparticle sedimentation from initial distributions on a cubic lattice or at random give good quantitative agreement with existing theories

systematic derivation of jump conditions for the immersed interface method in three dimensional flow simulation in this paper we systematically derive jump conditions for the immersed interface method siam j numer anal 31 1994 pp 1019 1044 siam j sci comput 18 1997 pp 709 735 to simulate three dimensional incompressible viscous flows subject to moving surfaces the surfaces are represented as singular forces in the navier stokes equations which give rise to discontinuities of flow quantities the principal jump conditions across a closed surface of the velocity the pressure and their normal derivatives have been derived by lai and li appl math lett 14 2001 pp 149 154 in this paper we first extend their derivation to generalized surface parametrization starting from the principal jump conditions we then derive the jump conditions of all first second and third order spatial derivatives of the velocity and the pressure we also derive the jump conditions of first and second order temporal derivatives of the velocity using these jump conditions the immersed interface method is applicable to the simulation of three dimensional incompressible viscous flows subject to moving surfaces where near the surfaces the first and second order spatial derivatives of the velocity and the pressure can be discretized with respectively third and second order accuracy and the first order temporal derivatives of the velocity can be discretized with second order accuracy

near optimal configurations in mean field disordered systems we present a general technique to compute how the energy of a configuration varies as a function of its overlap with the ground state in the case of optimization problems our approach is based on a generalization of the cavity method to a system interacting with its ground state with this technique we study the random matching problem as well as the mean field diluted spin glass as a by product of this approach we calculate the de almeida thouless transition line of the spin glass on a fixed connectivity random graph

cccp algorithms to minimize the bethe and kikuchi free energies convergent alternatives to belief propagation this article introduces a class of discrete iterative algorithms that are provably convergent alternatives to belief propagation bp and generalized belief propagation gbp our work builds on recent results by yedidia freeman and weiss 2000 who showed that the fixed points of bp and gbp algorithms correspond to extrema of the bethe and kikuchi free energies respectively we obtain two algorithms by applying cccp to the bethe and kikuchi free energies respectively cccp is a procedure introduced here for obtaining discrete iterative algorithms by decomposing a cost function into a concave and a convex part we implement our cccp algorithms on two and three dimensional spin glasses and compare their results to bp and gbp our simulations show that the cccp algorithms are stable and converge very quickly the speed of cccp is similar to that of bp and gbp unlike cccp bp will often not converge for these problems gbp usually but not always converges the results found by cccp applied to the bethe or kikuchi free energies are equivalent or slightly better than those found by bp or gbp respectively when bp and gbp converge note that for these and other problems bp and gbp give very accurate results see yedidia et al 2000 and failure to converge is their major error mode finally we point out that our algorithms have a large range of inference and learning applications

constructing free energy approximations and generalized belief propagation algorithms important inference problems in statistical physics computer vision error correcting coding theory and artificial intelligence can all be reformulated as the computation of marginal probabilities on factor graphs the belief propagation bp algorithm is an efficient way to solve these problems that is exact when the factor graph is a tree but only approximate when the factor graph has cycles we show that bp fixed points correspond to the stationary points of the bethe approximation of the free energy for a factor graph we explain how to obtain region based free energy approximations that improve the bethe approximation and corresponding generalized belief propagation gbp algorithms we emphasize the conditions a free energy approximation must satisfy in order to be a valid or maxent normal approximation we describe the relationship between four different methods that can be used to generate valid approximations the bethe method the junction graph method the cluster variation method and the region graph method finally we explain how to tell whether a region based approximation and its corresponding gbp algorithm is likely to be accurate and describe empirical results showing that gbp can significantly outperform bp

a ribbon hopf algebra approach to the irreducible representations of centralizer algebras the brauer birman wenzl and type a iwahori hecke algebras abstract we show how the ribbon hopf algebra structure on the drinfel d jimbo quantum groups of types a b c and d can be used to derive formulas giving explicit realizations of the irreducible representations of the iwahori hecke algebras of type a and the birman wenzl algebras we use this derivation to give explicit realizations of the irreducible representations of the brauer algebras as well the derivation is accomplished by way of a combination of techniques from operator algebras quantum groups and the theory of 3 manifold invariants although our applications are in the cases of the quantum groups of types a b c and d most of the aspects of our approach apply in the general setting of ribbon hopf algebras

modeling elastic shells immersed in fluid we describe a numerical method to simulate an elastic shell immersed in a viscous incompressible fluid the method is developed as an extension of the immersed boundary method using shell equations based on the kirchhoff love and the planar stress hypotheses a detailed derivation of the shell equations used in the numerical method is presented this derivation as well as the numerical method uses techniques of differential geometry our main motivation for developing this method is its use in constructing a comprehensive threedimensional computational model of the cochlea the inner ear the central object of study within the cochlea is the basilar membrane which is immersed in fluid and whose elastic properties rather resemble those of a shell we apply the method to a specific example which is a prototype of a piece of the basilar membrane and study the convergence of the method in this case some typical features of cochlear mechanics are already captured in this simple model in particular numerical experiments have shown a traveling wave propagating from the base to the apex of the model shell in response to external excitation in the fluid c 2004 wiley periodicals inc

numerical simulation of a cylinder in uniform flow in this study a virtual boundary technique is applied to the numerical simulation of stationary and moving cylinders in uniform flow this approach readily allows the imposition of a no slip boundary within the flow field by a feedback forcing term added to the momentum equations in the present work this technique is used with a high order finite difference method effectively eliminating spurious oscillations caused by the feedback forcing when used with spectrally discretized flow solvers very good agreement is found between the present calculations and previous computational and experimental results for steady and time dependent flow at low reynolds numbers

on schur algebras and related algebras ii this paper is a continuation of 7 the purpose of 7 was to set up in the context of reductive algebraic groups a theory of generalized schur algebras a special case of our construction gives the schur algebras s n r studied extensively in lo we concentrate here on the schur algebras themselves and show that our construction yields new results in their representation theory by means of the schur functor see 10 chap 6 we obtain new results in the representation theory of the symmetric groups the main results are as follows the schur algebras s n r defined over a principal ideal domain r have finite global dimension see also 1 i over a field or complete valuation ring r every finitely generated projective s n r module has a weyl module filtration we prove the irreducibility of the socle of certain weyl modules see also 15 we describe a connection between weights of projective indecomposable modules for the schur algebras in terms of the involution on irreducible representations of symmetric groups given by tensoring with the sign representation we show that over a complete valuation ring or a field every young module for a symmetric group has a specht series in particular the projective indecomposables have specht series finally we show that for r n and a complete valuation ring or field r the blocks of the schur algebra s n r are given by the rule embodied in nakayama s conjecture the notations and conventions are as in the first part of this work 7

region graph partition function expansion and approximate free energy landscapes theory and some numerical results graphical models for finite dimensional spin glasses and real world combinatorial optimization and satisfaction problems usually have an abundant number of short loops the cluster variation method and its extension the region graph method are theoretical approaches for treating the complicated short loop induced local correlations for graphical models represented by non redundant or redundant region graphs approximate free energy landscapes are constructed in this paper through the mathematical framework of region graph partition function expansion several free energy functionals are obtained each of which use a set of probability distribution functions or functionals as order parameters these probability distribution function functionals are required to satisfy the region graph belief propagation equation or the region graph survey propagation equation to ensure vanishing correction contributions of region subgraphs with dangling edges as a simple application of the general theory we perform region graph belief propagation simulations on the square lattice ferromagnetic ising model and the edwards anderson model considerable improvements over the conventional bethe peierls approximation are achieved collective domains of different sizes in the disordered and frustrated square lattice are identified by the message passing procedure such collective domains and the frustrations among them are responsible for the low temperature glass like dynamical behaviors of the system

proteus a direct forcing method in the simulations of particulate flows a new and efficient direct numerical method for the simulation of particulate flows is introduced the method combines desired elements of the immersed boundary method the direct forcing method and the lattice boltzmann method adding a forcing term in the momentum equation enforces the no slip condition on the boundary of a moving particle by applying the direct forcing scheme proteus eliminates the need for the determination of free parameters such as the stiffness coefficient in the penalty scheme or the two relaxation parameters in the adaptive forcing scheme the method presents a significant improvement over the previously introduced immersed boundary lattice boltzmann method ib lbm where the forcing term was computed using a penalty method and a user defined parameter the method allows the enforcement of the rigid body motion of a particle in a more efficient way compared to the bounce back scheme used in the conventional lbm the direct forcing method provides a smoother computational boundary for particles and is capable of achieving results at higher reynolds number flows by using a set of lagrangian points to track the boundary of a particle proteus eliminates any need for the determination of the boundary nodes that are prescribed by the bounce back scheme at every time step it also makes computations for particles of irregular shapes simpler and more efficient proteus has been developed in two as well as three dimensions this new method has been validated by comparing its results with those from experimental measurements for a single sphere settling in an enclosure under gravity as a demonstration of the efficiency and capabilities of the present method the settling of a large number 1232 of spherical particles is simulated in a narrow box under two different boundary conditions it is found that when the no slip boundary condition is imposed at the front and rear sides of the box the particles motion is significantly hindered under the periodic boundary conditions the particles move faster the simulations show that the sedimentation characteristics in a box with periodic boundary conditions at the two sides are very close to those found in the sedimentation of two dimensional circular particles

diagrammatic kazhdan lusztig theory for the walled brauer algebra we determine the decomposition numbers for the brauer and walled brauer algebras in characteristic zero in terms of certain polynomials associated to cap and curl diagrams recovering a result of martin in the brauer case we consider a second family of polynomials associated to such diagrams and use these to determine projective resolutions of the standard modules we then relate these two families of polynomials to kazhdan lusztig theory via the work of lascoux schutzenberger and boe inspired by work of brundan and stroppel in the cap diagram case

the decomposition matrices of the brauer algebra over the complex field the brauer algebra was introduced by r brauer in 1937 as a tool in invariant theory the problem of determining the cartan decomposition matrix of the brauer algebra over the complex field has remained open since then here we determine this fundamental invariant

splendid equivalences derived categories and permutation modules we introduce the notion of a splendid equivalence between blocks of finite groups which is a strengthening of the notion of an equivalence of derived categories such an equivalence is always induced by a two sided tilting complex whose terms are summands of permutation modules a feature that is compatible with the belief that these complexes should be related to the adic cohomology of deligne lusztig varities in the case of reductive groups over finite fields we show that a splendid equivalence has good consequences over and above those that follow from a derived equivalence in particular it gives for principal blocks a structural explanation of brou s concept of an isotypy a compatible family of perfect isometries we give several examples including examples of morita equivalences that are splendid in an unexpectedly non trivial way

inference algorithm for finite dimensional spin glasses belief propagation on the dual lattice starting from a cluster variational method and inspired by the correctness of the paramagnetic ansatz at high temperatures in general and at any temperature in the two dimensional 2d edwards anderson ea model we propose a message passing algorithm the dual algorithm to estimate the marginal probabilities of spin glasses on finite dimensional lattices we use the ea models in 2d and 3d as benchmarks the dual algorithm improves the bethe approximation and we show that in a wide range of temperatures compared to the bethe critical temperature our algorithm compares very well with monte carlo simulations with the double loop algorithm and with exact calculation of the ground state of 2d systems with bimodal and gaussian interactions moreover it is usually 100 times faster than other provably convergent methods as the double loop algorithm in 2d and 3d the quality of the inference deteriorates only where the correlation length becomes very large i e at low temperatures in 2d and close to the critical temperature in 3d

coloring random graphs we study the graph coloring problem over random graphs of finite average connectivity c given a number q of available colors we find that graphs with low connectivity admit almost always a proper coloring whereas graphs with high connectivity are uncolorable depending on q we find the precise value of the critical average connectivity c q moreover we show that below c q there exists a clustering phase c e c d c q in which ground states spontaneously divide into an exponential number of clusters and where the proliferation of metastable states is responsible for the onset of complexity in local search algorithms

a spectral element formulation of the immersed boundary method for newtonian fluids a spectral element formulation of the immersed boundary method ibm is presented the spectral element formulation se ibm is a generalisation of the finite element immersed boundary method fe ibm based on high order approximations of the fluid variables several schemes for tracking the movement of the immersed boundary are considered and a semi implicit euler scheme is shown to offer advantages in terms of accuracy and efficiency high order spectral element approximations provide improved area conservation properties of the ibm due to the incompressibility constraint being more accurately satisfied superior orders of convergence are obtained for se ibm compared with fe ibm in both l2 and h1 norms the area conservation and convergence properties of the scheme are demonstrated on a series of benchmark problems

2 d parachute simulation by the immersed boundary method parachute aerodynamics involves an interaction between the flexible elastic porous parachute canopy and the high speed airflow relative to the parachute through which the parachute falls computer simulation of parachute dynamics typically simplifies the problem in various ways e g by considering the parachute as a rigid bluff body here we avoid such simplification by using the immersed boundary ib method to study the full fluid structure interaction the ib method is generalized to handle porous immersed boundaries and the generalized method is used to study the influence of porosity on parachute stability

the derived categories of some blocks of symmetric groups and a conjecture of broue abstract a well known conjecture of broue in the representation theory of finite groups involves equivalences of derived categories of blocks the aim of this paper is to verify this conjecture for defect 2 blocks of symmetric groups actually we prove for these blocks a refinement of broue s conjecture due to rickard

on central idempotents in the brauer algebra abstract we provide a method for constructing central idempotents in the brauer algebra using the splitting of short exact sequences of bimodules from this we determine certain primitive central idempotents by working over a suitable integral ring we hence demonstrate an efficient method of constructing pieces of the representation theory of the brauer algebra over artinian rings from the integral case

cluster variation method in statistical physics and probabilistic graphical models the cluster variation method cvm is a hierarchy of approximate variational techniques for discrete ising like models in equilibrium statistical mechanics improving on the mean field approximation and the bethe peierls approximation which can be regarded as the lowest level of the cvm in recent years it has been applied both in statistical physics and to inference and optimization problems formulated in terms of probabilistic graphical models the foundations of the cvm are briefly reviewed and the relations with similar techniques are discussed the main properties of the method are considered with emphasis on its exactness for particular models and on its asymptotic properties the problem of the minimization of the variational free energy which arises in the cvm is also addressed and recent results about both provably convergent and message passing algorithms are discussed

replica cluster variational method we present a general formalism to make the replica symmetric and replica symmetry breaking ansatz in the context of kikuchi s cluster variational method cvm using replicas and the message passing formulation of cvm we obtain a variational expression of the replicated free energy of a system with quenched disorder both averaged and on a single sample and make the hierarchical ansatz using functionals of functions of fields to represent the messages we obtain a set of integral equations for the message functionals the main difference with the bethe case is that the functionals appear in the equations in implicit form and are not positive definite thus standard iterative population dynamic algorithms cannot be used to determine them in the simplest cases the solution could be obtained iteratively using fourier transforms

simulations of valveless pumping in an open elastic tube mathematical models and numerical simulations of flows driven by pumping without valves valveless pumping are presented this work has been originally motivated by a biomedical objective to explain the complicated valveless blood flow mechanism in the circulation for instance the fetal circulation before the formation of valves and blood circulation during cardiopulmonary resuscitation a mathematical model of valveless pumping either in a closed loop system or in an open system consists of a couple of tubes with different elasticities or radii in this work we develop new models which are not necessarily connected by two different materials only one open elastic tube and an open elastic tube contained in a closed almost rigid tank although only one soft material is used or the soft and rigid materials are not connected we have observed the existence of a net flow driven by the periodic compress and release action and the important features of valveless pumping that have been observed in earlier models or experiments we have also shown that there exist mostly one directional net flows inside the elastic tube if a long and thin tube is considered and the pumping is applied to the short portion near the edge of the tube this might explain why most earlier reports on the physical experiments could not easily observe the existence of both directional net flows depending on the parameters such as frequency another important result is that the direction and the magnitude of a net flow can be explained by the sign and the amount of power which is work done on the fluid by the fluid pressure and the elastic wall over one period respectively a new feature in this work is that only one elastic material is sufficient to show the existence of a net flow in a valveless pump system because of a simple structure in our new model it is much easier to construct a valveless pump system applicable to real world applications such as a microelectromechanical system device

random k satisfiability problem from an analytic solution to an efficient algorithm we study the problem of satisfiability of randomly chosen clauses each with k boolean variables using the cavity method at zero temperature we find the phase diagram for the k 3 case we show the existence of an intermediate phase in the satisfiable region where the proliferation of metastable states is at the origin of the slowdown of search algorithms the fundamental order parameter introduced in the cavity method which consists of surveys of local magnetic fields in the various possible states of the system can be computed for one given sample these surveys can be used to invent new types of algorithms for solving hard combinatorial optimizations problems one such algorithm is shown here for the k 3 satisfiability problem with very good performances

smoothed profile method for particulate flows error analysis and simulations abstract we re formulate and analyze a new method for particulate flows the so called smoothed profile method spm first proposed in y nakayama r yamamoto simulation method to resolve hydrodynamic interactions in colloidal dispersions phys rev e 71 2005 036707 which uses a fixed computational mesh without conformation to the geometry of the particles the method represents the particles by certain smoothed profiles to construct a body force term added into the navier stokes equations spm imposes accurately and efficiently the proper conditions at the particle fluid interface in particular while the original method employs a fully explicit time integration scheme we develop a high order semi implicit splitting scheme which we implement in the context of spectral hp element discretization first we show that the modeling error of spm has a non monotonic dependence on the time step size t it is a function of t where is the kinematic viscosity of fluid and is the interface thickness of the smoothed profile subsequently we present several steady and unsteady simulations including flow past 3d complex shaped particles and compare against direct numerical simulations and the force coupling method fcm

a front tracking method for viscous incompressible multi fluid flows abstract a method to simulate unsteady multi fluid flows in which a sharp interface or a front separates incompressible fluids of different density and viscosity is described the flow field is discretized by a conservative finite difference approximation on a stationary grid and the interface is explicitly represented by a separate unstructured grid that moves through the stationary grid since the interface deforms continuously it is necessary to restructure its grid as the calculations proceed in addition to keeping the density and viscosity stratification sharp the tracked interface provides a natural way to include surface tension effects both two and three dimensional full numerical simulations of bubble motion are presented

sufficient conditions for convergence of the sum product algorithm novel conditions are derived that guarantee convergence of the sum product algorithm also known as loopy belief propagation or simply belief propagation bp to a unique fixed point irrespective of the initial messages for parallel synchronous updates the computational complexity of the conditions is polynomial in the number of variables in contrast with previously existing conditions our results are directly applicable to arbitrary factor graphs with discrete variables and are shown to be valid also in the case of factors containing zeros under some additional conditions the conditions are compared with existing ones numerically and if possible analytically for binary variables with pairwise interactions sufficient conditions are derived that take into account local evidence i e single variable factors and the type of pair interactions attractive or repulsive it is shown empirically that this bound outperforms existing bounds

improved volume conservation in the computation of flows with immersed elastic boundaries this paper introduces a recipe for the construction of a finite difference divergence operator the coefficients of which are completely determined once an interpolation scheme has been chosen substitution of this divergence operator for the previously used divergence based on central differences makes a dramatic improvement in the overall volume conservation that is observed in an immersed boundary computation this improvement is particularly important for computations in which an elastic boundary separates chambers containing fluid at substantially different pressures a situation which is prominent in cardiac fluid dynamics during the contraction of the ventricles