default search action
Markus Hegland
Person information
- affiliation: Australian National University, Acton, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i8]Markus Hegland, Zbigniew Stachurski, Conrad J. Burden:
Computing expected moments of the Rényi parking problem on the circle. CoRR abs/2301.12115 (2023) - [i7]Markus Hegland, Janosch Rieger:
Generalized Gearhart-Koshy acceleration is a Krylov space method of a new type. CoRR abs/2311.18305 (2023) - 2022
- [j24]Dean Muir
, David Pfefferlé
Numerical integration of particle orbits in discontinuous fields using VENUS-LEVIS and SPEC. Comput. Phys. Commun. 271: 108191 (2022) - 2021
- [i6]Frank de Hoog, Markus Hegland:
A Note on Error Bounds for Pseudo Skeleton Approximations of Matrices. CoRR abs/2107.01819 (2021) - 2020
- [i5]Markus Hegland, Frank de Hoog:
Low rank approximation of positive semi-definite symmetric matrices using Gaussian elimination and volume sampling. CoRR abs/2011.14626 (2020)
2010 – 2019
- 2019
- [i4]Yossi Bokor
Stratified Space Learning: Reconstructing Embedded Graphs. CoRR abs/1909.12474 (2019) - 2016
- [j23]Md. Mohsin Ali
Complex scientific applications made fault-tolerant with the sparse grid combination technique. Int. J. High Perform. Comput. Appl. 30(3): 335-359 (2016) - [p2]Markus Hegland
Recent Developments in the Theory and Application of the Sparse Grid Combination Technique. Software for Exascale Computing 2016: 143-163 - [p1]Alfredo Parra-Hinojosa, Brendan Harding
Handling Silent Data Corruption with the Sparse Grid Combination Technique. Software for Exascale Computing 2016: 187-208 - 2015
- [j22]Markus Hegland
Sparse grid quadrature on products of spheres. Numer. Algorithms 70(3): 485-517 (2015) - [j21]Brendan Harding
Fault Tolerant Computation with the Sparse Grid Combination Technique. SIAM J. Sci. Comput. 37(3) (2015) - [c32]Md. Mohsin Ali
A fault-tolerant gyrokinetic plasma application using the sparse grid combination technique. HPCS 2015: 499-507 - 2014
- [j20]Bishnu P. Lamichhane
A new multivariate spline based on mixed partial derivatives and its finite element approximation. Appl. Math. Lett. 35: 82-85 (2014) - [c31]Valeriy Khakhutskyy, Markus Hegland
Parallel Fitting of Additive Models for Regression. KI 2014: 243-254 - [i3]Brendan Harding, Markus Hegland, Jay Walter Larson, James Southern:
Scalable and Fault Tolerant Computation with the Sparse Grid Combination Technique. CoRR abs/1404.2670 (2014) - 2013
- [j19]Markus Hegland
On tractability of approximation in special function spaces. J. Complex. 29(1): 76-91 (2013) - [c30]Jay Walter Larson, Markus Hegland
Fault-Tolerant Grid-Based Solvers: Combining Concepts from Sparse Grids and MapReduce. ICCS 2013: 130-139 - [c29]Christoph Kowitz, Markus Hegland
The Sparse Grid Combination Technique for Computing Eigenvalues in Linear Gyrokinetics. ICCS 2013: 449-458 - [c28]Hans-Joachim Bungartz, Dirk Pflüger, Markus Hegland
High-Dimensional Meets Parallel: Algorithms and Applications. PARCO 2013: 563-563 - [c27]Philipp Hupp, Riko Jacob, Mario Heene, Dirk Pflüger, Markus Hegland
Global Communication Schemes for the Sparse Grid Combination Technique. PARCO 2013: 564-573 - [c26]Brendan Harding
A Parallel Fault Tolerant Combination Technique. PARCO 2013: 584-592 - [c25]Jay Walter Larson, Peter E. Strazdins, Markus Hegland
Managing Complexity in the Parallel Sparse Grid Combination Technique. PARCO 2013: 593-602 - [c24]Valeriy Khakhutskyy, Dirk Pflüger, Markus Hegland
Scalability and Fault Tolerance of the Alternating Direction Method of Multipliers for Sparse Grids. PARCO 2013: 603-612 - 2012
- [i2]Markus Hegland, Paul C. Leopardi:
Sparse grid quadrature on products of spheres. CoRR abs/1202.5710 (2012) - 2011
- [j18]Markus Hegland
Dilational interpolatory inequalities. Math. Comput. 80(274): 1019-1036 (2011) - [c23]Peter Strazdins, Markus Hegland
Performance analysis of a cardiac simulation code using IPM. ScalA@SC 2011: 29-32 - 2010
- [j17]Markus Hegland
Guest Editors' Preface. J. Complex. 26(5): 407 (2010) - [j16]Michael Griebel, Markus Hegland
A Finite Element Method for Density Estimation with Gaussian Process Priors. SIAM J. Numer. Anal. 47(6): 4759-4792 (2010) - [c22]Vikram Sunkara, Markus Hegland
An optimal Finite State Projection Method. ICCS 2010: 1579-1586
2000 – 2009
- 2009
- [j15]Jochen Garcke
Fitting multidimensional data using gradient penalties and the sparse grid combination technique. Computing 84(1-2): 1-25 (2009) - 2006
- [c21]Jochen Garcke, Markus Hegland:
Fitting Multidimensional Data Using Gradient Penalties and Combination Techniques. HPSC 2006: 235-248 - [c20]Markus Hegland, Conrad J. Burden, Lucia Santoso:
Modelling Gene Regulatory Networks Using Galerkin Techniques Based on State Space Aggregation and Sparse Grids. HPSC 2006: 259-272 - 2005
- [j14]Shawn W. Laffan
Sparse Grids: a new predictive modelling method for the analysis of geographic data. Int. J. Geogr. Inf. Sci. 19(3): 267-292 (2005) - 2004
- [c19]Peter Christen, Tim Churches, Markus Hegland
Febrl - A Parallel Open Source Data Linkage System: http://datamining.anu.edu.au/linkage.html. PAKDD 2004: 638-647 - [c18]Tatiana Semenova, Markus Hegland
Conceptual Mining of Large Administrative Health Data. PAKDD 2004: 659-669 - 2003
- [j13]Stephen G. Roberts
Approximation of a Thin Plate Spline Smoother Using Continuous Piecewise Polynomial Functions. SIAM J. Numer. Anal. 41(1): 208-234 (2003) - [c17]Jochen Garcke
Parallelisation of Sparse Grids for Large Scale Data Analysis. International Conference on Computational Science 2003: 683-692 - [c16]Agnes Boskovitz, Rajeev Goré, Markus Hegland
A Logical Formalisation of the Fellegi-Holt Method of Data Cleaning. IDA 2003: 554-565 - 2002
- [c15]Markus Hegland
Algorithms for Association Rules. Machine Learning Summer School 2002: 226-234 - [e1]Simeon J. Simoff, Graham J. Williams, Markus Hegland:
The 15th Australian Joint Conference on Artificial Intelligence 2002, Proceedings Australasian Data Mining Workshop, Canberra, Australia, 3rd December 2002. University of Technology Sydney, Australia 2002, ISBN 0-9750075-0-5 [contents] - 2001
- [j12]Markus Hegland
Parallel Interior Point Schemes for Solving Multistage Convex Programming. Ann. Oper. Res. 108(1-4): 75-85 (2001) - [j11]Peter Christen, Markus Hegland
Scalable parallel algorithms for surface fitting and data mining. Parallel Comput. 27(7): 941-961 (2001) - [c14]Simon Hawkins, Graham J. Williams
Data Mining of Administrative Claims Data for Pathology Services. HICSS 2001 - [c13]Peter Christen, Markus Hegland
Towards a Parallel Data Mining Toolbox. IPDPS 2001: 156 - [c12]Ole Møller Nielsen, Peter Christen, Markus Hegland
A Toolbox Approach to Flexible and Efficient Data Mining. PAKDD 2001: 124-135 - 2000
- [j10]Sergey Bakin, Markus Hegland, Michael R. Osborne:
Parallel MARS Algorithm Based on B-splines. Comput. Stat. 15(4): 463-484 (2000) - [j9]Ole Møller Nielsen, Markus Hegland
Parallel Performance of Fast Wavelet Transforms. Int. J. High Speed Comput. 11(1): 55-74 (2000) - [j8]Sergey Bakin, Markus Hegland
Mining taxation data with parallel BMARS. Parallel Algorithms Appl. 15(1-2): 37-55 (2000)
1990 – 1999
- 1999
- [j7]Robert S. Anderssen, Markus Hegland:
For numerical differentiation, dimensionality can be a blessing! Math. Comput. 68(227): 1121-1141 (1999) - [j6]Peter Arbenz, Andrew J. Cleary, Jack J. Dongarra, Markus Hegland:
A Comparison of Parallel Solvers for Diagonally Dominant and General Narrow-Banded Linear Systems. Parallel Distributed Comput. Pract. 2(4) (1999) - [j5]Markus Hegland
A Parallel Algorithm for the Reduction to Tridiagonal Form for Eigendecomposition. SIAM J. Sci. Comput. 21(3): 987-1005 (1999) - [c11]Peter Arbenz, Andrew J. Cleary, Jack J. Dongarra, Markus Hegland:
A Comparison of Parallel Solvers for Diagonally Dominant and General Narrow-Banded Linear Systems II. Euro-Par 1999: 1078-1087 - [c10]Graham J. Williams
The Integrated Delivery of Large-Scale Data Mining: The ACSys Data Mining Project. Large-Scale Parallel Data Mining 1999: 24-55 - [c9]Peter Christen, Irfan Altas, Markus Hegland, Stephen G. Roberts, Kevin Burrage, Roger B. Sidje:
A parallel finite element surface fitting algorithm for data mining. PARCO 1999: 275-282 - [i1]Markus Hegland, Vladimir Pestov:
Additive models in high dimensions. CoRR cs.DS/9912020 (1999) - 1998
- [c8]Markus Hegland, Michael R. Osborne:
Algorithms for Block Bidiagonal Systems on Vector and Parallel Computers. International Conference on Supercomputing 1998: 1-6 - [c7]Richard P. Brent, L. Grosz, David L. Harrar II, Markus Hegland, Margaret Kahn, G. Keating, G. Mercer, Ole Møller Nielsen, Michael R. Osborne, Bing Bing Zhou, M. Nakanishi:
Development of a Mathematical Subroutine Library for Fujitsu Vector Parallel Processors. International Conference on Supercomputing 1998: 13-20 - [c6]Michael K. Ng, Zhexue Huang, Markus Hegland
Data-Mining Massive Time Series Astronomical Data Sets - A Case Study. PAKDD 1998: 401-402 - 1997
- [j4]Markus Hegland, W. W. Wheeler:
Linear Bijections and the Fast Fourier Transform. Appl. Algebra Eng. Commun. Comput. 8(2): 143-163 (1997) - [j3]M. Thamban Nair, Markus Hegland, Robert S. Anderssen:
The trade-off between regularity and stability in Tikhonov regularization. Math. Comput. 66(217): 193-206 (1997) - [c5]Peter Arbenz, Markus Hegland:
The Stable Parallel Solution of Narrow Banded Linear Systems. PP 1997 - 1996
- [j2]Markus Hegland
Real and Complex Fast Fourier Transforms on the Fujitsu VPP 500. Parallel Comput. 22(4): 539-553 (1996) - [c4]Markus Hegland:
Divide and Conquer for the Solution of Banded Linear Systems of Equations. PDP 1996: 394-403 - 1995
- [j1]Markus Hegland:
An Implementation of Multiple and Multivariate Fourier Transforms on Vector Processors. SIAM J. Sci. Comput. 16(2): 271-288 (1995) - 1993
- [c3]Markus Hegland:
Block Algorithms for FFTs on Vector and Parallel Computers. PARCO 1993: 129-136 - 1991
- [c2]Markus Hegland:
Implementing partition on vector computers. ICS 1991: 304-311 - 1990
- [c1]Markus Hegland
On the Computation of Breeding Values. CONPAR 1990: 232-242
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: