Algorithms for computing symbolic representations of basic \(e\)-sums and their application to composites

DOI10.1016/j.jsc.2015.08.001zbMath1330.74179OpenAlexW1069162158MaRDI QIDQ898265

Wojciech Nawalaniec

Publication date: 8 December 2015

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2015.08.001

zbMATH Keywords

computer algebrasymbolic computationseffective conductivityoptimal packing problembasic sumssymbol manipulation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatorial optimization (90C27) Electromagnetic effects in solid mechanics (74F15)

Related Items

A criterion of collective behavior of bacteria ⋮ Analysis of distributions of stadiums on the plane using \(e\)-sums ⋮ Boundary value problems and their applications to 2D composites theory ⋮ Regularization method for stable structural features ⋮ Effective Properties of Fibrous Composites and Cluster Convergence ⋮ Efficient computation of basic sums for random polydispersed composites

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compact packings of the plane with two sizes of discs
• Some densest two-size disc packings in the plane
• 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
• Longitudinal Permeability of Spatially Periodic Rectangular Arrays of Circular Cylinders I. A Single Cylinder in the Unit Cell
• Generalized Clausius-Mossotti formula for random composite with circular fibers.