Efficient computation of basic sums for random polydispersed composites
DOI10.1007/s40314-017-0449-6zbMath1392.74011OpenAlexW2608621297MaRDI QIDQ725852
Publication date: 2 August 2018
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-017-0449-6
algorithmsoptimal packing problembasic sumsdiscrete multidimensional convolutions of functionseffective conductivity of composites
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Composite and mixture properties (74E30) Optimization of other properties in solid mechanics (74P10) Random materials and composite materials (74A40)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A criterion of collective behavior of bacteria
- A linear programming algorithm to test for jamming in hard-sphere packings
- Algorithms for computing symbolic representations of basic \(e\)-sums and their application to composites
- Bounds for effective elastic moduli of disordered materials
- Transport properties of a rectangular array of highly conducting cylinders
- Increase and decrease of the effective conductivity of two-phase composites due to polydispersity
- Optimal Distribution of the Nonoverlapping Conducting Disks
- Representative cell in mechanics of composites and generalized Eisenstein–Rayleigh sums
- Effective Conductivity and Critical Properties of a Hexagonal Array of Superconducting Cylinders
- Generalized Clausius-Mossotti formula for random composite with circular fibers.
- Random heterogeneous materials. Microstructure and macroscopic properties
This page was built for publication: Efficient computation of basic sums for random polydispersed composites
