for Journals by Title or ISSN for Articles by Keywords help
 Subjects -> COMPUTER SCIENCE (Total: 2011 journals)     - ANIMATION AND SIMULATION (30 journals)    - ARTIFICIAL INTELLIGENCE (98 journals)    - AUTOMATION AND ROBOTICS (98 journals)    - CLOUD COMPUTING AND NETWORKS (61 journals)    - COMPUTER ARCHITECTURE (9 journals)    - COMPUTER ENGINEERING (9 journals)    - COMPUTER GAMES (16 journals)    - COMPUTER PROGRAMMING (24 journals)    - COMPUTER SCIENCE (1172 journals)    - COMPUTER SECURITY (46 journals)    - DATA BASE MANAGEMENT (13 journals)    - DATA MINING (32 journals)    - E-BUSINESS (22 journals)    - E-LEARNING (29 journals)    - ELECTRONIC DATA PROCESSING (21 journals)    - IMAGE AND VIDEO PROCESSING (39 journals)    - INFORMATION SYSTEMS (108 journals)    - INTERNET (92 journals)    - SOCIAL WEB (50 journals)    - SOFTWARE (34 journals)    - THEORY OF COMPUTING (8 journals) COMPUTER SCIENCE (1172 journals)                  1 2 3 4 5 6 | Last
 Advances in Computational Mathematics   [SJR: 1.255]   [H-I: 44]   [18 followers]  Follow         Hybrid journal (It can contain Open Access articles)    ISSN (Print) 1572-9044 - ISSN (Online) 1019-7168    Published by Springer-Verlag  [2355 journals]
• Sparse blind deconvolution and demixing through ℓ 1,2 -minimization
• Authors: Axel Flinth
Pages: 1 - 21
Abstract: This paper concerns solving the sparse deconvolution and demixing problem using ℓ 1,2-minimization. We show that under a certain structured random model, robust and stable recovery is possible. The results extend results of Ling and Strohmer (Inverse Probl. 31, 115002 2015), and in particular theoretically explain certain experimental findings from that paper. Our results do not only apply to the deconvolution and demixing problem, but to recovery of column-sparse matrices in general.
PubDate: 2018-02-01
DOI: 10.1007/s10444-017-9533-0
Issue No: Vol. 44, No. 1 (2018)

• A wirebasket preconditioner for the mortar boundary element method
• Authors: Thomas Führer; Norbert Heuer
Pages: 23 - 49
Abstract: We present and analyze a preconditioner of the additive Schwarz type for the mortar boundary element method. As a basic splitting, on each subdomain we separate the degrees of freedom related to its boundary from the inner degrees of freedom. The corresponding wirebasket-type space decomposition is stable up to logarithmic terms. For the blocks that correspond to the inner degrees of freedom standard preconditioners for the hypersingular integral operator on open boundaries can be used. For the boundary and interface parts as well as the Lagrangian multiplier space, simple diagonal preconditioners are optimal. Our technique applies to quasi-uniform and non-uniform meshes of shape-regular elements. Numerical experiments on triangular and quadrilateral meshes confirm theoretical bounds for condition and MINRES iteration numbers.
PubDate: 2018-02-01
DOI: 10.1007/s10444-017-9534-z
Issue No: Vol. 44, No. 1 (2018)

• Frame completions with prescribed norms: local minimizers and applications
• Authors: Pedro G. Massey; Noelia B. Rios; Demetrio Stojanoff
Pages: 51 - 86
Abstract: Let $$\mathcal {F}_{0}=\{f_{i}\}_{i\in \mathbb {I}_{n_{0}}}$$ be a finite sequence of vectors in $$\mathbb {C}^{d}$$ and let $$\mathbf {a}=(a_{i})_{i\in \mathbb {I}_{k}}$$ be a finite sequence of positive numbers, where $$\mathbb {I}_{n}=\{1,\ldots , n\}$$ for $$n\in \mathbb {N}$$ . We consider the completions of $$\mathcal {F}_{0}$$ of the form $$\mathcal {F}=(\mathcal {F}_{0},\mathcal {G})$$ obtained by appending a sequence $$\mathcal {G}=\{g_{i}\}_{i\in \mathbb {I}_{k}}$$ of vectors in $$\mathbb {C}^{d}$$ such that ∥g i ∥2 = a i for $$i\in \mathbb {I}_{k}$$ , and endow the set of completions with the metric $$d(\mathcal {F},\tilde {\mathcal {F}}) =\max \{ \,\ g_{i}-\tilde {g}_{i}\ : \ i\in \mathbb {I}_{k}\}$$ where $$\tilde {\mathcal {F}}=(\mathcal {F}_{0},\,\tilde {\mathcal {G}})$$ . In this context we show that local minimizers on the set of completions of a convex potential P φ , induced by a strictly convex function φ, are also global minimizers. In case that φ(x) = x 2 then P φ is the so-called frame potential introduced by Benedetto and Fickus, and our work generalizes several well known results for this potential. We show that there is an intimate connection between frame completion problems with prescribed norms and frame operator distance (FOD) problems. We use this connection and our results to settle in the affirmative a generalized version of Strawn’s conjecture on the FOD.
PubDate: 2018-02-01
DOI: 10.1007/s10444-017-9535-y
Issue No: Vol. 44, No. 1 (2018)

• A linear formulation for disk conformal parameterization of
simply-connected open surfaces
• Authors: Gary Pui-Tung Choi; Lok Ming Lui
Pages: 87 - 114
Abstract: Surface parameterization is widely used in computer graphics and geometry processing. It simplifies challenging tasks such as surface registrations, morphing, remeshing and texture mapping. In this paper, we present an efficient algorithm for computing the disk conformal parameterization of simply-connected open surfaces. A double covering technique is used to turn a simply-connected open surface into a genus-0 closed surface, and then a fast algorithm for parameterization of genus-0 closed surfaces can be applied. The symmetry of the double covered surface preserves the efficiency of the computation. A planar parameterization can then be obtained with the aid of a Möbius transformation and the stereographic projection. After that, a normalization step is applied to guarantee the circular boundary. Finally, we achieve a bijective disk conformal parameterization by a composition of quasi-conformal mappings. Experimental results demonstrate a significant improvement in the computational time by over 60%. At the same time, our proposed method retains comparable accuracy, bijectivity and robustness when compared with the state-of-the-art approaches. Applications to texture mapping are presented for illustrating the effectiveness of our proposed algorithm.
PubDate: 2018-02-01
DOI: 10.1007/s10444-017-9536-x
Issue No: Vol. 44, No. 1 (2018)

• Some multilevel decoupled algorithms for a mixed navier-stokes/darcy model
• Authors: Mingchao Cai; Peiqi Huang; Mo Mu
Pages: 115 - 145
Abstract: In this work, several multilevel decoupled algorithms are proposed for a mixed Navier-Stokes/Darcy model. These algorithms are based on either successively or parallelly solving two linear subdomain problems after solving a coupled nonlinear coarse grid problem. Error estimates are given to demonstrate the approximation accuracy of the algorithms. Experiments based on both the first order and the second order discretizations are presented to show the effectiveness of the decoupled algorithms.
PubDate: 2018-02-01
DOI: 10.1007/s10444-017-9537-9
Issue No: Vol. 44, No. 1 (2018)

• Fine structures for the solutions of the two-dimensional Riemann problems
by high-order WENO schemes
• Authors: Chang-Yeol Jung; Thien Binh Nguyen
Pages: 147 - 174
Abstract: The two-dimensional Riemann problem with polytropic gas is considered. By a restriction on the constant states of each quadrant of the computational domain such that there is only one planar centered wave connecting two adjacent quadrants, there are nineteen genuinely different initial configurations of the problem. The configurations are numerically simulated on a fine grid and compared by the 5th-order WENO-Z5, 6th-order WENO-ðœƒ6, and 7th-order WENO-Z7 schemes. The solutions are very well approximated with high resolution of waves interactions phenomena and different types of Mach shock reflections. Kelvin-Helmholtz instability-like secondary-scaled vortices along contact continuities are well resolved and visualized. Numerical solutions show that WENO-ðœƒ6 outperforms the comparing WENO-Z5 and WENO-Z7 in terms of shock capturing and small-scaled vortices resolution. A catalog of the numerical solutions of all nineteen configurations obtained from the WENO-ðœƒ6 scheme is listed. Thanks to their excellent resolution and sharp shock capturing, the numerical solutions presented in this work can be served as reference solutions for both future numerical and theoretical analyses of the 2D Riemann problem.
PubDate: 2018-02-01
DOI: 10.1007/s10444-017-9538-8
Issue No: Vol. 44, No. 1 (2018)

• A numerical method for solving three-dimensional elliptic interface
problems with triple junction points
• Authors: Liqun Wang; Songming Hou; Liwei Shi
Pages: 175 - 193
Abstract: Elliptic interface problems with multi-domains have wide applications in engineering and science. However, it is challenging for most existing methods to solve three-dimensional elliptic interface problems with multi-domains due to local geometric complexity, especially for problems with matrix coefficient and sharp-edged interface. There are some recent work in two dimensions for multi-domains and in three dimensions for two domains. However, the extension to three dimensional multi-domain elliptic interface problems is non-trivial. In this paper, we present an efficient non-traditional finite element method with non-body-fitting grids for three-dimensional elliptic interface problems with multi-domains. Numerical experiments show that this method achieves close to second order accurate in the L ∞ norm for piecewise smooth solutions.
PubDate: 2018-02-01
DOI: 10.1007/s10444-017-9539-7
Issue No: Vol. 44, No. 1 (2018)

• Analysis of the grad-div stabilization for the time-dependent
Navier–Stokes equations with inf-sup stable finite elements
• Authors: Javier de Frutos; Bosco García-Archilla; Volker John; Julia Novo
Pages: 195 - 225
Abstract: This paper studies inf-sup stable finite element discretizations of the evolutionary Navier–Stokes equations with a grad-div type stabilization. The analysis covers both the case in which the solution is assumed to be smooth and consequently has to satisfy nonlocal compatibility conditions as well as the practically relevant situation in which the nonlocal compatibility conditions are not satisfied. The constants in the error bounds obtained do not depend on negative powers of the viscosity. Taking into account the loss of regularity suffered by the solution of the Navier–Stokes equations at the initial time in the absence of nonlocal compatibility conditions of the data, error bounds of order $$\mathcal O(h^{2})$$ in space are proved. The analysis is optimal for quadratic/linear inf-sup stable pairs of finite elements. Both the continuous-in-time case and the fully discrete scheme with the backward Euler method as time integrator are analyzed.
PubDate: 2018-02-01
DOI: 10.1007/s10444-017-9540-1
Issue No: Vol. 44, No. 1 (2018)

• Bernstein-Bézier techniques for divergence of polynomial spline
vector fields in ℝ n
• Authors: Tatyana Sorokina
Pages: 227 - 244
Abstract: Bernstein-Bézier techniques for analyzing polynomial spline fields in n variables and their divergence are developed. Dimension and a minimal determining set for continuous piecewise divergence-free spline fields on the Alfeld split of a simplex in ℝ n are obtained using the new techniques, as well as the dimension formula for continuous piecewise divergence-free splines on the Alfeld refinement of an arbitrary simplicial partition in ℝ n .
PubDate: 2018-02-01
DOI: 10.1007/s10444-017-9541-0
Issue No: Vol. 44, No. 1 (2018)

• A plane wave method combined with local spectral elements for
nonhomogeneous Helmholtz equation and time-harmonic Maxwell equations
• Authors: Qiya Hu; Long Yuan
Pages: 245 - 275
Abstract: In this paper we are concerned with plane wave discretizations of nonhomogeneous Helmholtz equation and time-harmonic Maxwell equations. To this end, we design a plane wave method combined with local spectral elements for the discretization of such nonhomogeneous equations. This method contains two steps: we first solve a series of nonhomogeneous local problems on auxiliary smooth subdomains by the spectral element method, and then apply the plane wave method to the discretization of the resulting (locally homogeneous) residue problem on the global solution domain. We derive error estimates of the approximate solutions generated by this method. The numerical results show that the resulting approximate solutions possess high accuracy.
PubDate: 2018-02-01
DOI: 10.1007/s10444-017-9542-z
Issue No: Vol. 44, No. 1 (2018)

• Convergent expansions of the Bessel functions in terms of elementary
functions
• Authors: José L. López
Pages: 277 - 294
Abstract: We consider the Bessel functions J ν (z) and Y ν (z) for R ν > −1/2 and R z ≥ 0. We derive a convergent expansion of J ν (z) in terms of the derivatives of $$(\sin z)/z$$ , and a convergent expansion of Y ν (z) in terms of derivatives of $$(1-\cos z)/z$$ , derivatives of (1 − e −z )/z and Γ(2ν, z). Both expansions hold uniformly in z in any fixed horizontal strip and are accompanied by error bounds. The accuracy of the approximations is illustrated with some numerical experiments.
PubDate: 2018-02-01
DOI: 10.1007/s10444-017-9543-y
Issue No: Vol. 44, No. 1 (2018)

• Computationally efficient modular nonlinear filter stabilization for high
Reynolds number flows
• Authors: Aziz Takhirov; Alexander Lozovskiy
Pages: 295 - 325
Abstract: The nonlinear filter based stabilization proposed in Layton et al. (J. Math. Fluid Mech. 14(2), 325–354 2012) allows to incorporate an eddy viscosity model into an existing laminar flow codes in a modular way. However, the proposed nonlinear filtering step requires the assembly of the associated matrix at each time step and solving a linear system with an indefinte matrix. We propose computationally efficient version of the filtering step that only requires the assembly once, and the solution of two symmetric, positive definite systems at each time step. We also test a new indicator function based on the entropy viscosity model of Guermond (Int. J. Numer. Meth. Fluids. 57(9), 1153–1170 2008); Guermond et al. (J. Sci. Comput. 49(1), 35–50 2011).
PubDate: 2018-02-01
DOI: 10.1007/s10444-017-9544-x
Issue No: Vol. 44, No. 1 (2018)

• High-order positivity-preserving hybrid finite-volume-finite-difference
methods for chemotaxis systems
• Authors: Alina Chertock; Yekaterina Epshteyn; Hengrui Hu; Alexander Kurganov
Pages: 327 - 350
Abstract: Chemotaxis refers to mechanisms by which cellular motion occurs in response to an external stimulus, usually a chemical one. Chemotaxis phenomenon plays an important role in bacteria/cell aggregation and pattern formation mechanisms, as well as in tumor growth. A common property of all chemotaxis systems is their ability to model a concentration phenomenon that mathematically results in rapid growth of solutions in small neighborhoods of concentration points/curves. The solutions may blow up or may exhibit a very singular, spiky behavior. There is consequently a need for accurate and computationally efficient numerical methods for the chemotaxis models. In this work, we develop and study novel high-order hybrid finite-volume-finite-difference schemes for the Patlak-Keller-Segel chemotaxis system and related models. We demonstrate high-accuracy, stability and computational efficiency of the proposed schemes in a number of numerical examples.
PubDate: 2018-02-01
DOI: 10.1007/s10444-017-9545-9
Issue No: Vol. 44, No. 1 (2018)

• Reducing the ill conditioning in the method of fundamental solutions
• Authors: Pedro R. S. Antunes
Pages: 351 - 365
Abstract: The method of fundamental solutions (MFS) is a meshless method for solving boundary value problems with some partial differential equations. It allows to obtain highly accurate approximations for the solutions assuming that they are smooth enough, even with small matrices. As a counterpart, the (dense) matrices involved are often ill-conditioned which is related to the well known uncertainty principle stating that it is impossible to have high accuracy and good conditioning at the same time. In this work, we propose a technique to reduce the ill conditioning in the MFS, assuming that the source points are placed on a circumference of radius R. The idea is to apply a suitable change of basis that provides new basis functions that span the same space as the MFS’s, but are much better conditioned. In the particular case of circular domains, the algorithm allows to obtain errors close to machine precision, with condition numbers of order O(1), independently of the number of points sources and R.
PubDate: 2018-02-01
DOI: 10.1007/s10444-017-9548-6
Issue No: Vol. 44, No. 1 (2018)

• Uniform asymptotic expansions for Laguerre polynomials and related
confluent hypergeometric functions
• Authors: T. M. Dunster; A. Gil; J. Segura
Abstract: Uniform asymptotic expansions involving exponential and Airy functions are obtained for Laguerre polynomials $$L_{n}^{(\alpha )}(x)$$ , as well as complementary confluent hypergeometric functions. The expansions are valid for n large and α small or large, uniformly for unbounded real and complex values of x. The new expansions extend the range of computability of $$L_{n}^{(\alpha )}(x)$$ compared to previous expansions, in particular with respect to higher terms and large values of α. Numerical evidence of their accuracy for real and complex values of x is provided.
PubDate: 2018-01-31
DOI: 10.1007/s10444-018-9589-5

• A phase field approach to shape optimization in Navier–Stokes flow with
integral state constraints
• Authors: Harald Garcke; Michael Hinze; Christian Kahle; Kei Fong Lam
Abstract: We consider the shape optimization of an object in Navier–Stokes flow by employing a combined phase field and porous medium approach, along with additional perimeter regularization. By considering integral control and state constraints, we extend the results of earlier works concerning the existence of optimal shapes and the derivation of first order optimality conditions. The control variable is a phase field function that prescribes the shape and topology of the object, while the state variables are the velocity and the pressure of the fluid. In our analysis, we cover a multitude of constraints which include constraints on the center of mass, the volume of the fluid region, and the total potential power of the object. Finally, we present numerical results of the optimization problem that is solved using the variable metric projection type (VMPT) method proposed by Blank and Rupprecht, where we consider one example of topology optimization without constraints and one example of maximizing the lift of the object with a state constraint, as well as a comparison with earlier results for the drag minimization.
PubDate: 2018-01-29
DOI: 10.1007/s10444-018-9586-8

• Neural network closures for nonlinear model order reduction
• Authors: Omer San; Romit Maulik
Abstract: Many reduced-order models are neither robust with respect to parameter changes nor cost-effective enough for handling the nonlinear dependence of complex dynamical systems. In this study, we put forth a robust machine learning framework for projection-based reduced-order modeling of such nonlinear and nonstationary systems. As a demonstration, we focus on a nonlinear advection-diffusion system given by the viscous Burgers equation, which is a prototypical setting of more realistic fluid dynamics applications due to its quadratic nonlinearity. In our proposed methodology the effects of truncated modes are modeled using a single layer feed-forward neural network architecture. The neural network architecture is trained by utilizing both the Bayesian regularization and extreme learning machine approaches, where the latter one is found to be more computationally efficient. A significant emphasis is laid on the selection of basis functions through the use of both Fourier bases and proper orthogonal decomposition. It is shown that the proposed model yields significant improvements in accuracy over the standard Galerkin projection methodology with a negligibly small computational overhead and provide reliable predictions with respect to parameter changes.
PubDate: 2018-01-29
DOI: 10.1007/s10444-018-9590-z

• Second-kind integral equations for the Laplace-Beltrami problem on
surfaces in three dimensions
• Authors: Michael O’Neil
Abstract: The Laplace-Beltrami problem ΔΓψ = f has several applications in mathematical physics, differential geometry, machine learning, and topology. In this work, we present novel second-kind integral equations for its solution which obviate the need for constructing a suitable parametrix to approximate the in-surface Green’s function. The resulting integral equations are well-conditioned and compatible with standard fast multipole methods and iterative linear algebraic solvers, as well as more modern fast direct solvers. Using layer-potential identities known as Calderón projectors, the Laplace-Beltrami operator can be pre-conditioned from the left and/or right to obtain second-kind integral equations. We demonstrate the accuracy and stability of the scheme in several numerical examples along surfaces described by curvilinear triangles.
PubDate: 2018-01-24
DOI: 10.1007/s10444-018-9587-7

• Efficient construction of 2-chains representing a basis of H 2 ( Ω ¯ ,
∂ Ω ; ℤ ) $H_{2}(\overline {\Omega }, \partial {\Omega }; \mathbb {Z})$
• Authors: Ana Alonso Rodríguez; Enrico Bertolazzi; Riccardo Ghiloni; Ruben Specogna
Abstract: We present an efficient algorithm for the construction of a basis of $$H_{2}(\overline {\Omega },\partial {\Omega };\mathbb {Z})$$ via the Poincaré-Lefschetz duality theorem. Denoting by g the first Betti number of $$\overline {\Omega }$$ the idea is to find, first g different 1-boundaries of $$\overline {\Omega }$$ with supports contained in ∂Ω whose homology classes in $$\mathbb {R}^{3} \setminus {\Omega }$$ form a basis of $$H_{1}(\mathbb {R}^{3} \setminus {\Omega };\mathbb {Z})$$ , and then to construct a set of 2-chains in $$\overline {\Omega }$$ having these 1-boundaries as their boundaries. The Poincaré-Lefschetz duality theorem ensures that the relative homology classes of these 2-chains in $$\overline {\Omega }$$ modulo ∂Ω form a basis of $$H_{2}(\overline {\Omega },\partial {\Omega };\mathbb {Z})$$ . We devise a simple procedure for the construction of the required set of 1-boundaries of $$\overline {\Omega }$$ that, combined with a fast algorithm for the construction of 2-chains with prescribed boundary, allows the efficient computation of a basis of $$H_{2}(\overline {\Omega },\partial {\Omega };\mathbb {Z})$$ via this very natural approach. Some numerical experiments show the efficiency of the method and its performance comparing with other algorithms.
PubDate: 2018-01-23
DOI: 10.1007/s10444-018-9588-6

• Theoretical investigations of the new Cokriging method for
variable-fidelity surrogate modeling
• Authors: Anna Bertram; Ralf Zimmermann
Abstract: Cokriging is a variable-fidelity surrogate modeling technique which emulates a target process based on the spatial correlation of sampled data of different levels of fidelity. In this work, we address two theoretical questions associated with the so-called new Cokriging method for variable-fidelity modeling: A mandatory requirement for the well-posedness of the Cokriging emulator is the positive definiteness of the associated Cokriging correlation matrix. Spatial correlations are usually modeled by positive definite correlation kernels, which are guaranteed to yield positive definite correlation matrices for mutually distinct sample points. However, in applications, low-fidelity information is often available at high-fidelity sample points and the Cokriging predictor may benefit from the additional information provided by such an inclusive sampling. We investigate the positive definiteness of the Cokriging covariance matrix in both of the aforementioned cases and derive sufficient conditions for the well-posedness of the Cokriging predictor. The approximation quality of the Cokriging predictor is highly dependent on a number of model- and hyper-parameters. These parameters are determined by the method of maximum likelihood estimation. For standard Kriging, closed-form optima of the model parameters along hyper-parameter profile lines are known. Yet, these do not readily transfer to the setting of Cokriging, since additional parameters arise, which exhibit a mutual dependence. In previous work, this obstacle was tackled via a numerical optimization. Here, we derive closed-form optima for all Cokriging model parameters along hyper-parameter profile lines. The findings are illustrated by numerical experiments.
PubDate: 2018-01-11
DOI: 10.1007/s10444-017-9585-1

JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327

Home (Search)
Subjects A-Z
Publishers A-Z
Customise
APIs