咨询与建议

限定检索结果

文献类型

  • 18 篇 期刊文献
  • 1 篇 会议

馆藏范围

  • 19 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 12 篇 理学
    • 12 篇 数学
    • 1 篇 物理学
    • 1 篇 统计学(可授理学、...
  • 10 篇 工学
    • 6 篇 计算机科学与技术...
    • 2 篇 电气工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 机械工程
    • 1 篇 动力工程及工程热...
    • 1 篇 环境科学与工程(可...
    • 1 篇 软件工程
  • 4 篇 管理学
    • 4 篇 管理科学与工程(可...

主题

  • 19 篇 ordering algorit...
  • 4 篇 sparse matrices
  • 4 篇 minimum degree a...
  • 3 篇 nested dissectio...
  • 3 篇 65f05
  • 3 篇 65f50
  • 3 篇 68r10
  • 2 篇 graph partitioni...
  • 2 篇 element partitio...
  • 2 篇 graph algorithms
  • 2 篇 computational co...
  • 2 篇 h adaptivity
  • 2 篇 ilupcg
  • 2 篇 finite element m...
  • 2 篇 sparse matrix
  • 2 篇 multi-frontal di...
  • 1 篇 preconditioning
  • 1 篇 laplacian matrix
  • 1 篇 simulation
  • 1 篇 graph spectra

机构

  • 2 篇 boeing informat ...
  • 2 篇 york univ dept c...
  • 1 篇 tavrian natl uni...
  • 1 篇 king abdullah un...
  • 1 篇 nasa ames res ct...
  • 1 篇 department of co...
  • 1 篇 univ wisconsin m...
  • 1 篇 rutherford apple...
  • 1 篇 univ aachen rhei...
  • 1 篇 yildiz tech univ...
  • 1 篇 york univ dept c...
  • 1 篇 oak ridge natl l...
  • 1 篇 univ wales dept ...
  • 1 篇 univ florida dep...
  • 1 篇 ilog inc mt view...
  • 1 篇 jagiellonian uni...
  • 1 篇 univ tennessee d...
  • 1 篇 department of me...
  • 1 篇 univ vienna fac ...
  • 1 篇 univ santiago co...

作者

  • 3 篇 ashcraft c
  • 3 篇 liu jwh
  • 2 篇 george a
  • 1 篇 martins n
  • 1 篇 paszynska anna
  • 1 篇 pothen a
  • 1 篇 chen sihan
  • 1 篇 heras db
  • 1 篇 jopek konrad
  • 1 篇 rothberg e
  • 1 篇 bayraktar ertugr...
  • 1 篇 lima ltg
  • 1 篇 allus abdullah
  • 1 篇 pingali keshav
  • 1 篇 sviridenko alexa...
  • 1 篇 genton marc g.
  • 1 篇 cabaleiro jc
  • 1 篇 shcherbina oleg
  • 1 篇 pinto hjcp
  • 1 篇 maciej paszyński

语言

  • 18 篇 英文
  • 1 篇 其他
检索条件"主题词=ordering algorithms"
19 条 记 录,以下是1-10 订阅
排序:
Improving efficiency and cost of ordering algorithms in pathfinding using shell layers
收藏 引用
EXPERT SYSTEMS WITH APPLICATIONS 2024年 第PartD期238卷
作者: Allus, Abdullah Diab, Abdul Moati Bayraktar, Ertugrul Yildiz Tech Univ Dept Mechatron Engn TR-34349 Istanbul Turkiye
Optimal path planning is a fundamental problem in artificial intelligence (AI) and has wide applications in areas such as robotics, transportation, and logistics. In this paper, we propose a novel approach for orderin... 详细信息
来源: 评论
On the impact of spatial covariance matrix ordering on tile low-rank estimation of Matérn parameters
收藏 引用
ENVIRONMETRICS 2024年 第6期35卷
作者: Chen, Sihan Abdulah, Sameh Sun, Ying Genton, Marc G. King Abdullah Univ Sci & Technol Stat Program Thuwal 23955 Saudi Arabia King Abdullah Univ Sci & Technol Extreme Comp Res Ctr ECRC Thuwal Saudi Arabia
Spatial statistical modeling involves processing an nxn$$ n\times n $$ symmetric positive definite covariance matrix, where n$$ n $$ denotes the number of locations. However, when n$$ n $$ is large, processing this co... 详细信息
来源: 评论
Hybrid direct and iterative solver with library of multi-criteria optimal orderings for h adaptive finite element method computations
Hybrid direct and iterative solver with library of multi-cri...
收藏 引用
16th Annual International Conference on Computational Science (ICCS)
作者: AbouEisha, Hassan Jopek, Konrad Medygral, Bartlomiej Moshkov, Mikhail Nosek, Szymon Paszynska, Anna Paszynski, Maciej Pingali, Keshav King Abdullah Univ Sci & Technol Comp Sci Thuwal Saudi Arabia King Abdullah Univ Sci & Technol Appl Math & Computat Sci Thuwal Saudi Arabia AGH Univ Sci & Technol Dept Comp Sci Krakow Poland Jagiellonian Univ Fac Phys Astron & Appl Comp Sci Krakow Poland Univ Texas Austin Inst Computat & Engn Sci Austin TX 78712 USA
In this paper we present a multi-criteria optimization of element partition trees and resulting orderings for multi-frontal solver algorithms executed for two dimensional h adaptive finite element method. In particula... 详细信息
来源: 评论
Hybrid Direct and Iterative Solver with Library of Multi-criteria Optimal orderings for h Adaptive Finite Element Method Computations
收藏 引用
Procedia Computer Science 2016年 80卷 865-874页
作者: Hassan AbouEisha Konrad Jopek Bartłomiej Medygrał Mikhail Moshkov Szymon Nosek Anna Paszyńska Maciej Paszyński Keshav Pingali Computer Science King Abdullah University of Science and Technology Thuwal Saudi Arabia Department of Computer Science AGH University of Science and Technology Kraków Poland Applied Mathematics and Computational Science King Abdullah University of Science and Technology Thuwal Saudi Arabia Faculty of Physics Astronomy and Applied Computer Science Jagiellonian University Kraków Poland Institute for Computational and Engineering Sciences The University of Texas at Austin USA
In this paper we present a multi-criteria optimization of element partition trees and resulting orderings for multi-frontal solver algorithms executed for two dimensional h adaptive finite element method. In particula... 详细信息
来源: 评论
Benchmarking ordering techniques for nonserial dynamic programming
收藏 引用
MEMETIC COMPUTING 2012年 第3期4卷 201-208页
作者: Sviridenko, Alexander Shcherbina, Oleg Tavrian Natl Univ Fac Math & Comp Sci Vernadsky Av 4 UA-95007 Simferopol Ukraine Univ Vienna Fac Math A-1090 Vienna Austria
Five ordering algorithms for the nonserial dynamic programming algorithm for solving sparse discrete optimization problems are compared in this paper. The benchmarking reveals that the ordering of the variables has a ... 详细信息
来源: 评论
Numbering techniques for preconditioners in iterative solvers for compressible flows
收藏 引用
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS 2007年 第3期55卷 241-261页
作者: Pollul, B. Reusken, A. Univ Aachen Rhein Westfal TH Aachen Inst Geometri & Prakt Math D-52056 Aachen Germany
We consider Newton-Krylov methods for solving discretized compressible Euler equations. A good preconditioner in the Krylov subspace method is crucial for the efficiency of the solver. In this paper we consider a poin... 详细信息
来源: 评论
Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods
收藏 引用
BIT NUMERICAL MATHEMATICS 2001年 第4期41卷 800-841页
作者: Schulze, J Univ Gesamthsch Paderborn Dept Comp Sci D-33102 Paderborn Germany
Most state-of-the-art ordering schemes for sparse matrices are a hybrid of a bottom-up method such as minimum degree and a top-down scheme such as George's nested dissection. In this paper we present an ordering a... 详细信息
来源: 评论
Modeling and improving locality for the sparse-matrix-vector product on cache memories
收藏 引用
FUTURE GENERATION COMPUTER SYSTEMS 2001年 第1期18卷 55-67页
作者: Heras, DB Blanco, V Cabaleiro, JC Rivera, FF Univ Santiago Compostela Dept Elect & Computac Santiago De Compostela 15706 Spain
A model for representing and improving the locality exhibited by the execution of sparse irregular problems is developed in this work. We focus on the product of a sparse matrix by a dense vector (SpM x V). We conside... 详细信息
来源: 评论
Genetic algorithm optimisation of a class of inventory control systems
收藏 引用
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2000年 第3期68卷 259-278页
作者: Disney, SM Naim, MM Towill, DR Univ Wales Dept Maritime Studies & Int Transport Logist Syst Dynam Grp Cardiff CF1 3YP S Glam Wales
The paper describes a procedure for optimising the performance of an industrially designed inventory control system. This has the three classic control policies utilising sales, inventory and pipeline information to s... 详细信息
来源: 评论
Robust ordering of sparse matrices using multisection
收藏 引用
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS 1998年 第3期19卷 816-832页
作者: Ashcraft, C Liu, JWH Boeing Informat & Support Serv Seattle WA 98124 USA York Univ Dept Comp Sci N York ON M3J 1P3 Canada
In this paper we provide a robust reordering scheme for sparse matrices. The scheme relies on the notion of multisection, a generalization of bisection. The reordering strategy is demonstrated to have consistently goo... 详细信息
来源: 评论