![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Journal of Computational and Applied Mathematics, Volume 278
Volume 278, April 2015
- Khosrow Maleknejad
, Reza Mollapourasl, Azadeh Ostadi
:
Convergence analysis of Sinc-collocation methods for nonlinear Fredholm integral equations with a weakly singular kernel. 1-11 - Chaojie Wang, Hongyi Li, Di Zhao:
An explicit formula for the inverse of a pentadiagonal Toeplitz matrix. 12-18 - Chuanqing Gu, Fei Xie, Ke Zhang
:
A two-step matrix splitting iteration for computing PageRank. 19-28 - Somayeh Nemati
:
Numerical solution of Volterra-Fredholm integral equations using Legendre collocation method. 29-36 - Filippo Domma
, Bozidar V. Popovic
, Saralees Nadarajah:
An extension of Azzalini's method. 37-47 - Rob Haelterman
, Ben Lauwens
, Helena Bruyninckx, Julien Petit
:
Equivalence of QN-LS and BQN-LS for affine problems. 48-51 - Jakob K. Hansen, Jarom D. Hogue, Grant K. Sander
, Rosemary A. Renaut
, Sudeep C. Popat:
Non-negatively constrained least squares and parameter choice by the residual periodogram for the inversion of electrochemical impedance spectroscopy data. 52-74 - Siraj-ul-Islam
, Sakhi Zaman:
New quadrature rules for highly oscillatory integrals with stationary points. 75-89 - Vittoria Demichelis, Matteo Sciarra:
Smoothness and error bounds of Martensen splines. 90-100 - Mirco Zerbetto, Diego Frezzato:
Summation through stochastic drawing of addends under steered morphing. 101-109 - Marko D. Petkovic, Miodrag S. Petkovic:
Hyper-power methods for the computation of outer inverses. 110-118 - Shanzhen Chen, X. Jiang, Fawang Liu
, Ian W. Turner
:
High order unconditionally stable difference schemes for the Riesz space-fractional telegraph equation. 119-129 - Dong Xuan Tran
:
Padé approximants for finite time ruin probabilities. 130-137 - Lizheng Lu:
Explicit algorithms for multiwise merging of Bézier curves. 138-148 - Yicheng Hong, Sungchul Lee, Tianguo Li:
Numerical method of pricing discretely monitored Barrier option. 149-161 - Zhong Li, Rachid Ait-Haddou
, Luc Biard:
Pythagorean hodograph spline spirals that match G3 Hermite data from circles. 162-180 - Leunglung Chan
, Eckhard Platen
:
Pricing and hedging of long dated variance swaps under a 3/2 volatility model. 181-196 - Qiang Ye, Weifeng Zhi:
Discrete Hessian Eigenmaps method for dimensionality reduction. 197-212 - Xinliang Chen, Griselda Deelstra, Jan Dhaene
, Daniël Linders
, Michèle Vanmaele
:
On an optimization problem related to static super-replicating strategies. 213-230 - Angel Blasco
, Sonia Pérez-Díaz
:
Asymptotes of space curves. 231-247 - Raúl Martín Martín
, Irene García Camacha Gutiérrez
:
Combined algorithm to compute D-optimal designs. 248-257 - Xiaofeng Zong
, Fuke Wu, Chengming Huang
:
Theta schemes for SDDEs with non-globally Lipschitz continuous coefficients. 258-277 - Rabeea Jari, Lin Mu:
Superconvergence of H(div) finite element approximations for the Stokes problem by local L2-projection methods. 278-292 - Payel Das, Gnaneshwar Nelakanti, Guangqing Long
:
Discrete Legendre spectral projection methods for Fredholm-Hammerstein integral equations. 293-305 - Gradimir V. Milovanovic
, Tomislav S. Igic, Dragana Turnic:
Generalized quadrature rules of Gaussian type for numerical evaluation of singular integrals. 306-325 - Roberto Bevilacqua
, Gianna M. Del Corso
, Luca Gemignani
:
Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding. 326-335
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.