A parallel algorithm for functions of triangular matrices

Computing ◽  
1996 ◽  
Vol 57 (1) ◽  
pp. 85-92 ◽  
Author(s):  
Ç. K. Koç ◽  
B. Bakkaloĝlu
2010 ◽  
Vol 24 (7) ◽  
pp. 638-642
Author(s):  
Linli Cui ◽  
Fan Yang ◽  
Qicong Peng

1988 ◽  
Author(s):  
Andrew V. Goldberg ◽  
Robert E. Tarjan

1996 ◽  
Vol 32 (19) ◽  
pp. 1766
Author(s):  
K.N. Balasubramanya Murthy ◽  
C. Siva Ram Murthy

2014 ◽  
Vol 51 (1) ◽  
pp. 1-18 ◽  
Author(s):  
Dawei Hong ◽  
Shushuang Man ◽  
Jean-Camille Birget ◽  
Desmond S. Lun

We construct a wavelet-based almost-sure uniform approximation of fractional Brownian motion (FBM) (Bt(H))_t∈[0,1] of Hurst index H ∈ (0, 1). Our results show that, by Haar wavelets which merely have one vanishing moment, an almost-sure uniform expansion of FBM for H ∈ (0, 1) can be established. The convergence rate of our approximation is derived. We also describe a parallel algorithm that generates sample paths of an FBM efficiently.


2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Saiful R. Mondal ◽  
Kottakkaran Sooppy Nisar ◽  
Thabet Abdeljawad

Abstract The article considers several polynomials induced by admissible lower triangular matrices and studies their subordination properties. The concept generalizes the notion of stable functions in the unit disk. Several illustrative examples, including those related to the Cesàro mean, are discussed, and connections are made with earlier works.


Sign in / Sign up

Export Citation Format

Share Document