Can compatible discretization, finite element methods, and discrete Clifford analysis be fruitfully combined?

Simple item page
dc.contributor.authorLeopardi, Paul
dc.date.accessioned2015-12-07T22:19:17Z
dc.date.issued2012
dc.date.updated2015-12-07T08:33:08Z
dc.identifier.issn2050-0300
dc.identifier.urihttp://hdl.handle.net/1885/19258
dc.publisherCambridge Scientific Publishers
dc.sourceClifford Analysis, Clifford Algebras and their applications
dc.titleCan compatible discretization, finite element methods, and discrete Clifford analysis be fruitfully combined?
dc.typeJournal article
local.bibliographicCitation.issue1
local.bibliographicCitation.lastpage64
local.bibliographicCitation.startpage57
local.contributor.affiliationLeopardi, Paul, College of Physical and Mathematical Sciences, ANU
local.contributor.authoruidLeopardi, Paul, u1576990
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.identifier.absfor010110 - Partial Differential Equations
local.identifier.absseo970101 - Expanding Knowledge in the Mathematical Sciences
local.identifier.ariespublicationu4743872xPUB7
local.identifier.citationvolume7
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
01_Leopardi_Can_compatible_discretization,_2012.pdf
Size:
140.73 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS