A simplicial branch and duality bound algorithm for the sum of convex–convex ratios problem
- 作者Pei-Ping Shen; Yun-Peng Duan; Yong-Gang Pei
- 卷第223卷
- 期第1期
- 印刷ISSN0377-0427
- 文件大小601.04KB
- 发表时间2009
- DOI10.1016/j.cam.2008.01.003
- 页码145-158
Gauss Quadrature for Refinable Weight FunctionsWalter Gautschi; Laura Gori; Francesca Pitolli · 2000
Refinable functions and positive operatorsLaura Gori; Francesca Pitolli · 2004
Positive Refinable OperatorsLaura Gori; Francesca Pitolli; Elisabetta Santi · Numerical Algorithms · 2001
Totally positive functions through nonstationary subdivision schemesCostanza Conti; Laura Gori; Francesca Pitolli · 2007
Refinable interpolatory and quasi-interpolatory operatorsLaura Gori; Francesca Pitolli; Elisabetta Santi · 2007
Totally positive refinable functions with general dilation MGori, Laura; Pitolli, Francesca · Applied Numerical Mathematics · 2016
On the Galerkin Method Based on a Particular Class of Scaling FunctionsLaura Gori; Francesca Pitolli; Laura Pezza · Numerical Algorithms · 2001