{"id":"https://openalex.org/W2119513700","doi":"https://doi.org/10.1007/978-3-642-36803-5_12","title":"Blocked Schur Algorithms for Computing the Matrix Square Root","display_name":"Blocked Schur Algorithms for Computing the Matrix Square Root","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2119513700","doi":"https://doi.org/10.1007/978-3-642-36803-5_12","mag":"2119513700"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-36803-5_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-36803-5_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1822/23671","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049826829","display_name":"Edvin Deadman","orcid":null},"institutions":[{"id":"https://openalex.org/I86122600","display_name":"Numerical Algorithms Group (United Kingdom)","ror":"https://ror.org/04pcnys31","country_code":"GB","type":"company","lineage":["https://openalex.org/I86122600"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Edvin Deadman","raw_affiliation_strings":["Numerical Algorithms Group, UK","Numerical Algorithms Group, UK#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Numerical Algorithms Group, UK","institution_ids":["https://openalex.org/I86122600"]},{"raw_affiliation_string":"Numerical Algorithms Group, UK#TAB#","institution_ids":["https://openalex.org/I86122600"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069339254","display_name":"Nicholas J. Higham","orcid":"https://orcid.org/0000-0001-5956-4976"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nicholas J. Higham","raw_affiliation_strings":["University of Manchester, UK","University of Manchester (UK)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Manchester, UK","institution_ids":["https://openalex.org/I28407311"]},{"raw_affiliation_string":"University of Manchester (UK)","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000842824","display_name":"Rui Ralha","orcid":"https://orcid.org/0000-0001-6789-4748"},"institutions":[{"id":"https://openalex.org/I99682543","display_name":"University of Minho","ror":"https://ror.org/037wpkx04","country_code":"PT","type":"education","lineage":["https://openalex.org/I99682543"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Rui Ralha","raw_affiliation_strings":["University of Minho, Portugal","UNIVERSITY OF MINHO, PORTUGAL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Minho, Portugal","institution_ids":["https://openalex.org/I99682543"]},{"raw_affiliation_string":"UNIVERSITY OF MINHO, PORTUGAL","institution_ids":["https://openalex.org/I99682543"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":6.1623,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.96771037,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"171","last_page":"182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/square-root","display_name":"Square root","score":0.7505598664283752},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.6338464021682739},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6191890835762024},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.6132580041885376},{"id":"https://openalex.org/keywords/square-matrix","display_name":"Square matrix","score":0.5713728666305542},{"id":"https://openalex.org/keywords/square","display_name":"Square (algebra)","score":0.5660014152526855},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5621138215065002},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.5382980704307556},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5182071328163147},{"id":"https://openalex.org/keywords/square-root-of-a-2-by-2-matrix","display_name":"Square root of a 2 by 2 matrix","score":0.4796657860279083},{"id":"https://openalex.org/keywords/triangular-matrix","display_name":"Triangular matrix","score":0.4650593400001526},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.4497957229614258},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4161025285720825},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3446006774902344},{"id":"https://openalex.org/keywords/symmetric-matrix","display_name":"Symmetric matrix","score":0.31548959016799927},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1078755259513855},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.06894150376319885}],"concepts":[{"id":"https://openalex.org/C11577676","wikidata":"https://www.wikidata.org/wiki/Q134237","display_name":"Square root","level":2,"score":0.7505598664283752},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.6338464021682739},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6191890835762024},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.6132580041885376},{"id":"https://openalex.org/C69044650","wikidata":"https://www.wikidata.org/wiki/Q2739329","display_name":"Square matrix","level":4,"score":0.5713728666305542},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.5660014152526855},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5621138215065002},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.5382980704307556},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5182071328163147},{"id":"https://openalex.org/C14964150","wikidata":"https://www.wikidata.org/wiki/Q7582079","display_name":"Square root of a 2 by 2 matrix","level":5,"score":0.4796657860279083},{"id":"https://openalex.org/C104528550","wikidata":"https://www.wikidata.org/wiki/Q506265","display_name":"Triangular matrix","level":3,"score":0.4650593400001526},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.4497957229614258},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4161025285720825},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3446006774902344},{"id":"https://openalex.org/C54848796","wikidata":"https://www.wikidata.org/wiki/Q339011","display_name":"Symmetric matrix","level":3,"score":0.31548959016799927},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1078755259513855},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.06894150376319885},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C96442724","wikidata":"https://www.wikidata.org/wiki/Q242188","display_name":"Invertible matrix","level":2,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1007/978-3-642-36803-5_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-36803-5_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:eprints.maths.manchester.ac.uk.MIMS.EPrints:1926","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400452","display_name":"MIMS EPrints (University of Southampton)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I43439940","host_organization_name":"University of Southampton","host_organization_lineage":["https://openalex.org/I43439940"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"MIMS Preprint"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.353.2083","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.353.2083","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.maths.man.ac.uk/~higham/papers/dhr13.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.666.1668","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.666.1668","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eprints.ma.man.ac.uk/1951/01/paper16.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/402fad9d-79b9-453b-92fd-b31b528becaa","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/402fad9d-79b9-453b-92fd-b31b528becaa","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Deadman, E, Higham, N J & Ralha, R 2013, Blocked Schur algorithms for computing the matrix square root. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. vol. 7782, Lecture Notes in Computer Science, Springer Nature, pp. 171-182, 11th International Conference on Applied Parallel and Scientific Computing, PARA 2012, Helsinki, 1/07/13. https://doi.org/10.1007/978-3-642-36803-5_12","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.atira.dk:publications/402fad9d-79b9-453b-92fd-b31b528becaa","is_oa":false,"landing_page_url":"https://www.research.manchester.ac.uk/portal/en/publications/blocked-schur-algorithms-for-computing-the-matrix-square-root(402fad9d-79b9-453b-92fd-b31b528becaa).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Deadman, E, Higham, N J & Ralha, R 2013, Blocked Schur algorithms for computing the matrix square root. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. vol. 7782, Lecture Notes in Computer Science, Springer Nature, pp. 171-182, 11th International Conference on Applied Parallel and Scientific Computing, PARA 2012, Helsinki, 1/07/13. https://doi.org/10.1007/978-3-642-36803-5_12","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:repositorium.sdum.uminho.pt:1822/23671","is_oa":true,"landing_page_url":"http://hdl.handle.net/1822/23671","pdf_url":null,"source":{"id":"https://openalex.org/S4306400354","display_name":"Reposit\u00f3riUM (Universidade do Minho)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99682543","host_organization_name":"University of Minho","host_organization_lineage":["https://openalex.org/I99682543"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:oai:repositorium.uminho.pt:1822/23671","is_oa":true,"landing_page_url":"https://hdl.handle.net/1822/23671","pdf_url":null,"source":{"id":"https://openalex.org/S4306402433","display_name":"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference paper"}],"best_oa_location":{"id":"pmh:oai:repositorium.sdum.uminho.pt:1822/23671","is_oa":true,"landing_page_url":"http://hdl.handle.net/1822/23671","pdf_url":null,"source":{"id":"https://openalex.org/S4306400354","display_name":"Reposit\u00f3riUM (Universidade do Minho)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99682543","host_organization_name":"University of Minho","host_organization_lineage":["https://openalex.org/I99682543"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W171922849","https://openalex.org/W1480928214","https://openalex.org/W1483804921","https://openalex.org/W1981576702","https://openalex.org/W2020804487","https://openalex.org/W2063599529","https://openalex.org/W2086619045","https://openalex.org/W2086824111","https://openalex.org/W2091491180","https://openalex.org/W2094758737","https://openalex.org/W2148551624","https://openalex.org/W2160829115","https://openalex.org/W2171562370","https://openalex.org/W2890534020","https://openalex.org/W4229666556","https://openalex.org/W4244373880"],"related_works":["https://openalex.org/W2373948857","https://openalex.org/W2355201024","https://openalex.org/W3184093895","https://openalex.org/W2020771115","https://openalex.org/W2039986365","https://openalex.org/W4238100916","https://openalex.org/W4232707102","https://openalex.org/W2376122632","https://openalex.org/W2381807583","https://openalex.org/W197798466"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-10T07:45:09.275182","created_date":"2025-10-10T00:00:00"}