Suchergebnisse - and problems complexity: numerical algorithms*

  1. 1

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

    ISSN: 0020-7160, 1029-0265
    Veröffentlicht: Abingdon Taylor & Francis 01.12.2009
    Veröffentlicht in International journal of computer mathematics (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 …”
    Volltext
    Journal Article
  2. 2

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

    ISSN: 0167-7055, 1467-8659
    Veröffentlicht: Oxford, UK Blackwell Publishing Ltd 01.02.2012
    Veröffentlicht in Computer graphics forum (01.02.2012)
    “… We propose a new estimator that solves this problem and provide both theoretical and empirical studies to verify it …”
    Volltext
    Journal Article
  3. 3

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

    ISSN: 0018-9340, 1557-9956
    Veröffentlicht: New York IEEE 01.04.2008
    Veröffentlicht in IEEE transactions on computers (01.04.2008)
    “… Dilated integers form an ordered group of the Cartesian indices into a d-dimensional array represented in the Morton order. Efficient implementations of its …”
    Volltext
    Journal Article
  4. 4

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

    ISSN: 0020-7160, 1029-0265
    Veröffentlicht: Gordon and Breach Science Publishers 01.01.1985
    Veröffentlicht in International journal of computer mathematics (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 …”
    Volltext
    Journal Article
  5. 5

    Quantum algorithms and complexity for numerical problems von Zhang, Chi

    ISBN: 1124584390, 9781124584393
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2011
    “… There are many numerical problems, especially those arising from quantum systems, which are notoriously difficult to solve using classical computers, since the computational time required often …”
    Volltext
    Dissertation
  6. 6

    Development of metaheuristics to solve a transportation inventory location routing problem considering lost sale for perishable goods von Fatemi Ghomi, S.M.T, Asgarian, B

    ISSN: 1746-5664, 1746-5672
    Veröffentlicht: Bradford Emerald Publishing Limited 11.02.2019
    Veröffentlicht in Journal of modelling in management (11.02.2019)
    “… Design/methodology/approach This paper proposes a novel mathematical model for transportation inventory location routing problem …”
    Volltext
    Journal Article
  7. 7

    Numerical Methods: Using MATLAB von Lindfield, George, Penny, John

    ISBN: 9780123869425, 0123869420
    Veröffentlicht: Chantilly Elsevier Science & Technology 2012
    “… Many worked examples are given together with exercises and solutions to illustrate how numerical methods can be used to study problems that have applications in the biosciences, chaos, optimization …”
    Volltext
    E-Book
  8. 8

    HABILIDADES DE RAZONAMIENTO MATEMÁTICO DE ESTUDIANTES DE EDUCACIÓN MEDIA SUPERIOR EN MÉXICO1 von Larrazolo, Norma, Backhoff, Eduardo, Tirado, Felipe

    ISSN: 1405-6666
    Veröffentlicht: Mexico City Consejo Mexicanao de Investigacion Educativa 01.10.2013
    Veröffentlicht in Revista mexicana de investigación educativa (01.10.2013)
    “… The results confirm that, the students have extremely low achievement, do not understand basic mathematical concepts, do not have the skills to solve numerical problems of medium complexity, and have …”
    Volltext
    Journal Article
  9. 9

    Robust Low-Tubal-Rank Tensor Completion Based on Tensor Factorization and Maximum Correntopy Criterion von He, Yicong, Atia, George K.

    ISSN: 2162-237X, 2162-2388, 2162-2388
    Veröffentlicht: United States IEEE 01.10.2024
    “… The goal of tensor completion is to recover a tensor from a subset of its entries, often by exploiting its low-rank property. Among several useful definitions …”
    Volltext
    Journal Article
  10. 10

    Painless Stochastic Conjugate Gradient for Large-Scale Machine Learning von Yang, Zhuang

    ISSN: 2162-237X, 2162-2388, 2162-2388
    Veröffentlicht: United States IEEE 01.10.2024
    “… Conjugate gradient (CG), as an effective technique to speed up gradient descent algorithms, has shown great potential and has widely been used for large-scale machine-learning problems …”
    Volltext
    Journal Article
  11. 11

    Securing Intelligent Reflecting Surface (IRS)–Aided NOMA Networks in Covert Wireless Communication Using Jammer von Najimi, Maryam

    ISSN: 1074-5351, 1099-1131
    Veröffentlicht: Chichester Wiley Subscription Services, Inc 01.06.2025
    Veröffentlicht in International journal of communication systems (01.06.2025)
    “… ABSTRACT In this paper, an intelligent reflecting surface (IRS)–assisted non‐orthogonal multiple access (NOMA) network is proposed in a multi‐user scenario …”
    Volltext
    Journal Article
  12. 12

    Sensitivity analysis applied to finite element method model for coupled multiphase system von Ngaradoumbe Nanhorngué, R., Pesavento, F., Schrefler, B.A.

    ISSN: 0363-9061, 1096-9853
    Veröffentlicht: Chichester Blackwell Publishing Ltd 10.10.2013
    “… This problem can be solved by using more effective numerical algorithms, or by trying to reduce the complexity of these models …”
    Volltext
    Journal Article
  13. 13

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

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

    Computational complexity continuum within Ising formulation of NP problems von Kalinin, Kirill P., Berloff, Natalia G.

    ISSN: 2399-3650, 2399-3650
    Veröffentlicht: London Nature Publishing Group UK 12.01.2022
    Veröffentlicht in Communications physics (12.01.2022)
    “… The minimisation of the Ising Hamiltonian is known to be NP-hard problem yet not all problem instances are equivalently hard to optimise …”
    Volltext
    Journal Article
  15. 15

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

    ISSN: 0096-3003, 1873-5649
    Veröffentlicht: Amsterdam Elsevier Inc 01.06.2010
    Veröffentlicht 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 …”
    Volltext
    Journal Article
  16. 16

    Deployment Optimization of Dual-functional UAVs for Integrated Localization and Communication von Yang, Zheyuan, Bi, Suzhi, Zhang, Ying-Jun Angela

    ISSN: 1536-1276, 1558-2248
    Veröffentlicht: New York IEEE 01.12.2023
    Veröffentlicht in IEEE transactions on wireless communications (01.12.2023)
    “… We investigate the optimization problem of deploying the minimal number of UAVs to satisfy the communication and localization requirements of ground users …”
    Volltext
    Journal Article
  17. 17

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

    ISSN: 0162-8828, 1939-3539
    Veröffentlicht: 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 …”
    Volltext
    Journal Article
  18. 18

    On Multistage Stochastic and Distributionally Robust Optimization: New Algorithms, Complexity Analysis, and Performance Comparison von Zhang, Shixuan

    ISBN: 9798263350710
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2022
    “… Multistage optimization under uncertainty refers to sequential decision-making with the presence of uncertainty information that is revealed partially until …”
    Volltext
    Dissertation
  19. 19

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

    ISBN: 9780549431008, 0549431004
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2008
    “… Numerical simulation of quantum systems appears to be our best option to understand, design and improve quantum systems …”
    Volltext
    Dissertation
  20. 20

    Channel Covariance Matrix Estimation via Dimension Reduction for Hybrid MIMO MmWave Communication Systems von Hu, Rui, Tong, Jun, Xi, Jiangtao, Guo, Qinghua, Yu, Yanguang

    ISSN: 1424-8220, 1424-8220
    Veröffentlicht: Switzerland MDPI AG 31.07.2019
    Veröffentlicht in Sensors (Basel, Switzerland) (31.07.2019)
    “… In this paper, we formulate the channel covariance estimation as a structured low-rank matrix sensing problem via Kronecker product expansion and use a low-complexity algorithm to solve this problem …”
    Volltext
    Journal Article