GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (257)
Document type
  • Articles  (257)
Source
Publisher
Years
Journal
Topic
  • 1
    facet.materialart.
    Unknown
    Springer
    In: CALCOLO
    Publication Date: 2018-03-06
    Description: Chebyshev pseudo-spectral method is one of the most efficient methods for solving continuous-time optimization problems. In this paper, we utilize this method to solve the general form of shortest path problem. Here, the main problem is converted into a nonlinear programming problem and by solving of which, we obtain an approximate shortest path. The feasibility of the nonlinear programming problem and the convergence of the method are given. Finally, some numerical examples are considered to show the efficiency of the presented method over the other methods.
    Print ISSN: 0008-0624
    Electronic ISSN: 1126-5434
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Publication Date: 2018-03-06
    Description: A Neumann series of Bessel functions (NSBF) representation for solutions of Sturm–Liouville equations and for their derivatives is obtained. The representation possesses an attractive feature for applications: for all real values of the spectral parameter \(\omega \) the estimate of the difference between the exact solution and the approximate one (the truncated NSBF) depends on N (the truncation parameter) and the coefficients of the equation and does not depend on \(\omega \) . A similar result is valid when \(\omega \in {\mathbb {C}}\) belongs to a strip \(\left| \hbox {Im }\omega \right| 〈C\) . This feature makes the NSBF representation especially useful for applications requiring computation of solutions for large intervals of \(\omega \) . Error and decay rate estimates are obtained. An algorithm for solving initial value, boundary value or spectral problems for the Sturm–Liouville equation is developed and illustrated on a test problem.
    Print ISSN: 0008-0624
    Electronic ISSN: 1126-5434
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Publication Date: 2018-03-06
    Description: In this paper, we propose an extended block Krylov process to construct two biorthogonal bases for the extended Krylov subspaces \(\mathbb {K}_{m}^e(A,V)\) and \(\mathbb {K}_{m}^e(A^{T},W)\) , where \(A \in \mathbb {R}^{n \times n}\) and \(V,~W \in \mathbb {R}^{n \times p}\) . After deriving some new theoretical results and algebraic properties, we apply the proposed algorithm with moment matching techniques for model reduction in large scale dynamical systems. Numerical experiments for large and sparse problems are given to show the efficiency of the proposed method.
    Print ISSN: 0008-0624
    Electronic ISSN: 1126-5434
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    Publication Date: 2018-03-06
    Description: In this paper, we propose a locking-free stabilized mixed finite element method for the linear elasticity problem, which employs a jump penalty term for the displacement approximation. The continuous piecewise k -order polynomial space is used for the stress and the discontinuous piecewise \((k-1)\) -order polynomial space for the displacement, where we require that \(k\ge 3\) in the two dimensions and \(k\ge 4\) in the three dimensions. The method is proved to be stable and k -order convergent for the stress in \(H(\mathrm {div})\) -norm and for the displacement in \(L^2\) -norm. Further, the convergence does not deteriorate in the nearly incompressible or incompressible case. Finally, the numerical results are presented to illustrate the optimal convergence of the stabilized mixed method.
    Print ISSN: 0008-0624
    Electronic ISSN: 1126-5434
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 5
    Publication Date: 2018-03-06
    Description: We address and discuss the application of nonlinear Galerkin methods for the model reduction and numerical solution of partial differential equations (PDE) with Turing instabilities in comparison with standard (linear) Galerkin methods. The model considered is a system of PDEs modelling the pattern formation in vegetation dynamics. In particular, by constructing the approximate inertial manifold on the basis of the spectral decomposition of the solution, we implement the so-called Euler–Galerkin method and we compare its efficiency and accuracy versus the linear Galerkin methods. We compare the efficiency of the methods by (a) the accuracy of the computed bifurcation points, and, (b) by the computation of the Hausdorff distance between the limit sets obtained by the Galerkin methods and the ones obtained with a reference finite difference scheme. The efficiency with respect to the required CPU time is also accessed. For our illustrations we used three different ODE time integrators, from the Matlab ODE suite. Our results indicate that the performance of the Euler–Galerkin method is superior compared to the linear Galerkin method when either explicit or linearly implicit time integration scheme are adopted. For the particular problem considered, we found that the dimension of approximate inertial manifold is strongly affected by the lenght of the spatial domain. Indeeed, we show that the number of modes required to accurately describe the long time Turing pattern forming solutions increases as the domain increases.
    Print ISSN: 0008-0624
    Electronic ISSN: 1126-5434
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 6
    Publication Date: 2018-03-06
    Description: This paper deals with interpolatory product integration rules based on Jacobi nodes, associated with the Banach space of all s -times continuously differentiable functions, and with a Banach space of absolutely integrable functions, on the interval \([-1,1]\) of the real axis. In order to highlight the topological structure of the set of unbounded divergence for the corresponding product quadrature formulas, a family of continuous linear operators associated with these product integration procedures is pointed out, and the unboundedness of the set of their norms is established, by means of some properties involving the theory of Jacobi polynomials. The main result of the paper is based on some principles of Functional Analysis, and emphasizes the phenomenon of double condensation of singularities with respect to the considered interpolatory product quadrature formulas, by pointing out large subsets (in topological meaning) of the considered Banach spaces, on which the quadrature procedures are unboundedly divergent.
    Print ISSN: 0008-0624
    Electronic ISSN: 1126-5434
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 7
    Publication Date: 2018-03-06
    Description: We introduce a two-parameter version of the two-step scale-splitting iteration method, called TTSCSP, for solving a broad class of complex symmetric system of linear equations. We present some conditions for the convergence of the method. An upper bound for the spectral radius of the method is presented and optimal parameters which minimize this bound are given. Inexact version of the TTSCSP iteration method (ITTSCSP) is also presented. Some numerical experiments are reported to verify the effectiveness of the TTSCSP iteration method and the numerical results are compared with those of the TSCSP, the SCSP and the PMHSS iteration methods. Numerical comparison of the ITTSCSP method with the inexact version of TSCSP, SCSP and PMHSS are presented. We also compare the numerical results of the BiCGSTAB method in conjunction with the TTSCSP and the ILU preconditioners.
    Print ISSN: 0008-0624
    Electronic ISSN: 1126-5434
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 8
    Publication Date: 2018-03-06
    Description: In this paper, we provide three types of general convergence theorems for Picard iteration in n -dimensional vector spaces over a valued field. These theorems can be used as tools to study the convergence of some particular Picard-type iterative methods. As an application, we present a new semilocal convergence theorem for the one-dimensional Newton method for approximating all the zeros of a polynomial simultaneously. This result improves in several directions the previous one given by Batra (BIT Numer Math 42:467–476, 2002 ).
    Print ISSN: 0008-0624
    Electronic ISSN: 1126-5434
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 9
    Publication Date: 2018-03-06
    Description: In this paper, we introduce implicit and explicit iterative methods for finding a zero of a monotone variational inclusion in Hilbert spaces. As consequence, an improvement modification of an algorithm existing in literature is obtained. A numerical example is given for illustrating our algorithm.
    Print ISSN: 0008-0624
    Electronic ISSN: 1126-5434
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 10
    Publication Date: 2018-03-06
    Description: The paper deals with the approximation of integrals of the type $$\begin{aligned} I(f;{\mathbf {t}})=\int _{{\mathrm {D}}} f({\mathbf {x}}) {\mathbf {K}}({\mathbf {x}},{\mathbf {t}}) {\mathbf {w}}({\mathbf {x}}) d{\mathbf {x}},\quad \quad {\mathbf {x}}=(x_1,x_2),\quad {\mathbf {t}}\in \mathrm {T}\subseteq \mathbb {R}^p, \ p\in \{1,2\} \end{aligned}$$ where \({\mathrm {D}}=[-\,1,1]^2\) , f is a function defined on \({\mathrm {D}}\) with possible algebraic singularities on \(\partial {\mathrm {D}}\) , \({\mathbf {w}}\) is the product of two Jacobi weight functions, and the kernel \({\mathbf {K}}\) can be of different kinds. We propose two cubature rules determining conditions under which the rules are stable and convergent. Along the paper we diffusely treat the numerical approximation for kernels which can be nearly singular and/or highly oscillating, by using a bivariate dilation technique. Some numerical examples which confirm the theoretical estimates are also proposed.
    Print ISSN: 0008-0624
    Electronic ISSN: 1126-5434
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...