Search Results - and problems complexity: numerical algorithms~

Refine Results
  1. 1

    Description and Solution of an Unreported Intrinsic Bias in Photon Mapping Density Estimation with Constant Kernel by García, R., Ureña, C., Sbert, M.

    ISSN: 0167-7055, 1467-8659
    Published: Oxford, UK Blackwell Publishing Ltd 01.02.2012
    Published in Computer graphics forum (01.02.2012)
    “…This paper presents an analysis of the irradiance estimator often used in photon mapping algorithms and concludes that the classical approach with a constant kernel overestimates the correct value…”
    Get full text
    Journal Article
  2. 2

    Division-free computation of subresultants using Bezout matrices by Kerber, Michael

    ISSN: 0020-7160, 1029-0265
    Published: Abingdon Taylor & Francis 01.12.2009
    “… Although the algorithm gives worse complexity bounds than pseudo-division approaches, our experiments show that our approach is superior for input polynomials with moderate degrees if the ground…”
    Get full text
    Journal Article
  3. 3

    Converting to and from Dilated Integers by Raman, R., Wise, D.S.

    ISSN: 0018-9340, 1557-9956
    Published: New York IEEE 01.04.2008
    Published in IEEE transactions on computers (01.04.2008)
    “… They are essential for programmers who would use Cartesian indexing there. Two algorithms for each casting conversion are presented here, including to-and-from dilated integers for both d = 2 and d = 3…”
    Get full text
    Journal Article
  4. 4

    Block LU decompositon of a band matrix on a systolic array by Robert, Yves

    ISSN: 0020-7160, 1029-0265
    Published: Gordon and Breach Science Publishers 01.01.1985
    “…After a brief discussion on systolic arrays for band matrix LU or QR decomposition, we introduce a new systolic array for the block 2x2 LU decompositon of a…”
    Get full text
    Journal Article
  5. 5

    Quantum algorithms and complexity for numerical problems by Zhang, Chi

    ISBN: 1124584390, 9781124584393
    Published: ProQuest Dissertations & Theses 01.01.2011
    “… Quantum algorithms can solve certain problems significantly faster than classical algorithms…”
    Get full text
    Dissertation
  6. 6

    Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems by Achache, Mohamed

    ISSN: 0096-3003, 1873-5649
    Published: Amsterdam Elsevier Inc 01.06.2010
    Published in Applied mathematics and computation (01.06.2010)
    “…In this paper we deal with the study of the polynomial complexity and numerical implementation for a short-step primal-dual interior point algorithm for monotone linear complementarity problems LCP…”
    Get full text
    Journal Article
  7. 7

    Solving Interval Quadratic Programming Problems by Using the Numerical Method and Swarm Algorithms by Elsisy, M. A., El-Shorbagy, M. A., Hammad, D. A.

    ISSN: 1076-2787, 1099-0526
    Published: Cairo, Egypt Hindawi Publishing Corporation 2020
    Published in Complexity (New York, N.Y.) (2020)
    “…In this paper, we present a new approach which is based on using numerical solutions and swarm algorithms (SAs…”
    Get full text
    Journal Article
  8. 8

    A survey of numerical algorithms that can solve the Lasso problems by Zhao, Yujie, Huo, Xiaoming

    ISSN: 1939-5108, 1939-0068
    Published: Hoboken, USA John Wiley & Sons, Inc 01.07.2023
    “… However, there lacks a comprehensive review discussing the algorithms to solve the optimization problem in Lasso…”
    Get full text
    Journal Article
  9. 9

    Fast Solution of 3-D Eddy-Current Problems in Multiply Connected Domains by a, v-φ and t-φ Formulations with Multigrid-based Algorithm for Cohomology Generation by Moro, Federico, Napov, Artem, Pellikka, Matti, Smajic, Jasmin, Codecasa, Lorenzo

    ISSN: 2169-3536, 2169-3536
    Published: Piscataway IEEE 2022
    Published in IEEE access (2022)
    “… This algorithm relies on an algebraic multigrid solver for curl-curl field problems, which ensures optimal computational complexity…”
    Get full text
    Journal Article
  10. 10

    PICARD: A novel code for the Galactic Cosmic Ray propagation problem by Kissmann, R.

    ISSN: 0927-6505, 1873-2852
    Published: Elsevier B.V 01.03.2014
    Published in Astroparticle physics (01.03.2014)
    “… We introduce a method using advanced contemporary numerical algorithms while retaining the general complexity of other established codes…”
    Get full text
    Journal Article
  11. 11

    On the complexity of classical and quantum algorithms for numerical problems in quantum mechanics by Bessen, Arvid J

    ISBN: 9780549431008, 0549431004
    Published: ProQuest Dissertations & Theses 01.01.2008
    “… Numerical simulation of quantum systems appears to be our best option to understand, design and improve quantum systems…”
    Get full text
    Dissertation
  12. 12

    An efficient solution to the five-point relative pose problem by Nister, D.

    ISSN: 0162-8828, 1939-3539
    Published: United States IEEE 01.06.2004
    “… It is the first algorithm well-suited for numerical implementation that also corresponds to the inherent complexity of the problem…”
    Get full text
    Journal Article
  13. 13

    Sensor Selection for Event Detection in Wireless Sensor Networks by Bajovic, D., Sinopoli, B., Xavier, J.

    ISSN: 1053-587X, 1941-0476
    Published: New York, NY IEEE 01.10.2011
    Published in IEEE transactions on signal processing (01.10.2011)
    “…)optimally solve the sensor selection problem, we propose an algorithm of affordable complexity…”
    Get full text
    Journal Article
  14. 14

    Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges by Li, Xiao, Guan, Xiucui, Jia, Junhua, Pardalos, Panos M.

    ISSN: 0925-5001, 1573-2916
    Published: New York Springer US 01.08.2025
    Published in Journal of global optimization (01.08.2025)
    “…The double interdiction problem on trees (DIT) for the sum of root-leaf distances (SRD…”
    Get full text
    Journal Article
  15. 15

    Distributed Stochastic Consensus Optimization With Momentum for Nonconvex Nonsmooth Problems by Wang, Zhiguo, Zhang, Jiawei, Chang, Tsung-Hui, Li, Jian, Luo, Zhi-Quan

    ISSN: 1053-587X, 1941-0476
    Published: New York IEEE 2021
    “…While many distributed optimization algorithms have been proposed for solving smooth or convex problems over the networks, few of them can handle non-convex and non-smooth problems…”
    Get full text
    Journal Article
  16. 16

    Fast O(N log N) Algorithm for Generating Rank-Minimized H2-Representation of Electrically Large Volume Integral Equations by Wang, Yifan, Jiao, Dan

    ISSN: 0018-926X, 1558-2221
    Published: New York IEEE 01.08.2022
    “… (VIEs). Unlike existing methods whose complexity is as high as quadratic, the proposed algorithm has linearithmic complexity, and thus, it can handle problems with large electrical sizes…”
    Get full text
    Journal Article
  17. 17

    Two fast variance-reduced proximal gradient algorithms for SMVIPs-Stochastic Mixed Variational Inequality Problems with suitable applications to stochastic network games and traffic assignment problems by Yang, Zhen-Ping, Lin, Gui-Hua

    ISSN: 0377-0427, 1879-1778
    Published: Elsevier B.V 01.07.2022
    “…In this paper, we propose two proximal gradient algorithms with variance reduction for stochastic mixed variational inequality problems…”
    Get full text
    Journal Article
  18. 18

    Low‐complexity linear massive MIMO detection based on the improved BFGS method by Li, Lin, Hu, Jianhao

    ISSN: 1751-8628, 1751-8636
    Published: Stevenage John Wiley & Sons, Inc 01.08.2022
    Published in IET communications (01.08.2022)
    “…‐dimensional matrix inversion involved, MMSE detection can be transformed into an unconstrained optimization problem and then solved by efficient numerical algorithms…”
    Get full text
    Journal Article
  19. 19

    Global optimization algorithm for solving linear multiplicative programming problems by Shen, Peiping, Wang, Kaimin, Lu, Ting

    ISSN: 0233-1934, 1029-4945
    Published: Philadelphia Taylor & Francis 03.06.2022
    Published in Optimization (03.06.2022)
    “…). A branch and bound algorithm is then located for globally solving problem (LMP). The convergence of the algorithm is established and its computational complexity is estimated. Finally, numerical results are reported to illustrate the feasibility and efficiency of the proposed algorithm…”
    Get full text
    Journal Article
  20. 20

    Algorithms for the continuous nonlinear resource allocation problem—New implementations and numerical studies by Patriksson, Michael, Strömberg, Christoffer

    ISSN: 0377-2217, 1872-6860
    Published: Amsterdam Elsevier B.V 16.06.2015
    Published in European journal of operational research (16.06.2015)
    “… (in theory and practice).•A comprehensive numerical study of non-linear problems at a very large scale. Patriksson (2008…”
    Get full text
    Journal Article