【摘 要】
：
We consider the problem of solving for the sparsest solution of large underdetermined linear system of equations where the matrix is the adjacency matrix of
论文部分内容阅读
We consider the problem of solving for the sparsest solution of large underdetermined linear system of equations where the matrix is the adjacency matrix of an expander graph corresponding with at most d neighbours per node.
其他文献
Subdivision schemes that are defined by a certain type of piecewise smooth nonlinear rules can be analized using the theory of generalized gradients.We shal
Given function values on a domain,possibly with noise,we examine the possibility of extending the function to a larger domain.In addition to smoothness at t
Subdivision schemes and their associated multiscale algorithms have led,over the past 20 years,to important breakthroughs in scientific computing including
Quantum graphs are a useful model in microelectronics and other areas.In this talk we report a solution [1] to a longstanding open problem showing that any
In this talk we present an algorithm for monotonic interpolation to monotone data on a rectangular mesh by piecewise bicubic functions.Carlton and Fritsch d
Many important chemical and biological phenomena are slow processes on time-scales from microsec to msec or much longer.The limitation of all-atom MD simula
I will describe recent extensions and applications of nonequilibrium umbrella sampling.In particular,I will show how it,and related enhanced sampling method
We discuss a geometry-based statistical learning framework for performing model reduction and modeling of stochastic high-dimensional dynamical systems: we
Many problems arising from chemistry,physics and materials science involve rare but significant exit events and/or transition events between stable states.T
One challenging image recovery problem is the so-called blind de-convolution problem,which aims at recovering the clear image from one blurred observation w