We show in this paper two ways to combine wavelet packets and total variation based deblurring methods. For this purpose, we first recall that it is possible to approximate a convolution by mean of an operator diagonal in a wavelet packet basis. Then, we show two possibilities, which uses this property, for combining wavelet packets and total variation approaches. We then show on experiments th...

Application of Eisenstat-SSOR Preconditioner to Realistic Stress Analysis Problem by Parallel Cache-Cache Computing Kuniyoshi Abe1, Seiji Fujino2 1Faculty of Economics and Information, Gifu Shotoku University, Japan; 2Professor Emeritus, Kyushu University, Japan Communication avoiding Neumann expansion preconditioner for LOBPCG method: Convergence property of exact diagonalization method for Hu...

We show in this paper two ways to combine wavelet packets and total variation based deblurring methods. For this purpose, we first recall that it is possible to approximate a convolution by mean of an operator diagonal in a wavelet packet basis. Then, we show two possibilities, which uses this property, for combining wavelet packets and total variation approaches. We then show on experiments th...

In this paper we introduce a new bijection from the set of Dyck paths to itself. This bijection has the property that it maps statistics that appeared recently in the study of pattern-avoiding permutations into classical statistics on Dyck paths, whose distribution is easy to obtain. We also present a generalization of the bijection, as well as several applications of it to enumeration problems...

We consider spread-out models of self-avoiding walk, bond percolation, lattice trees and bond lattice animals on Zd , having long finite-range connections, above their upper critical dimensions d = 4 (self-avoiding walk), d = 6 (percolation) and d = 8 (trees and animals). The two-point functions for these models are respectively the generating function for selfavoiding walks from the origin to ...

It is shown that the effective string recently introduced to describe the long distance dynamics of 3D gauge systems in the confining phase has an intriguing description in terms of models of 2D self-avoiding walks in the dense phase. The deconfinement point, where the effective string becomes N = 2 supersymmetric, may then be interpreted as the tricritical Θ point where the polymer chain under...

We study three-dimensional self-avoiding walks in presence of a one-dimensional excluded region. We show the appearance of a universal sub-leading exponent which is independent of the particular shape and symmetries of the excluded region. A classical argument provides the estimate: ∆ = 2ν − 1 ≈ 0.175(1). The numerical simulation gives ∆ = 0.18(2).

In this paper, we propose a new texture analysis method using the deterministic partially selfavoiding walk performed on maps modified with thresholds. In this method, two pixels of the map are neighbors if the Euclidean distance between them is less than √ 2 and the weight (difference between its intensities) is less than a given threshold. The maps obtained by using different thresholds highl...

We have calculated long series expansions for self-avoiding walks and polygons on the honeycomb lattice, including series for metric properties such as mean-squared radius of gyration as well as series for moments of the area-distribution for polygons. Analysis of the series yields accurate estimates for the connective constant, critical exponents and amplitudes of honeycomb self-avoiding walks...